Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata

被引：0
|
作者：
Hundeshagen, Norbert [1 ]
Otto, Friedrich [1 ]
Vollweiler, Marcel [1 ]
机构：
[1] Univ Kassel, Fachbereich Elektrotech Informat, D-34109 Kassel, Germany
来源：
IMPLEMENTATION AND APPLICATION OF AUTOMATA | 2011年 / 6482卷
关键词：
LANGUAGES;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We associate a transduction (that is, a binary relation) with the characteristic language of a. restarting automaton, and we prove that in this way monotone deterministic restarting automata yield a characterization of pushdown transductions. Then we study the class of transductions that are computed by parallel communicating systems (PC-systems) of monotone deterministic restarting automata. We will see that this class includes all transductions that are computable.
引用
收藏
页码：163 / 172
页数：10
相关论文
共 49 条
  • [41] Deterministic Safety Guarantees for Learning-Based Control of Monotone Nonlinear Systems Under Uncertainty
    Adamek, Joshua
    Heinlein, Moritz
    Lueken, Lukas
    Lucia, Sergio
    IEEE CONTROL SYSTEMS LETTERS, 2024, 8 : 1030 - 1035
  • [42] Deterministic finite capacity automata: A solution to reduce the complexity of modeling and control of automated manufacturing systems
    Qiu, RG
    Joshi, SB
    PROCEEDINGS OF THE 1996 IEEE INTERNATIONAL SYMPOSIUM ON COMPUTER-AIDED CONTROL SYSTEM DESIGN, 1996, : 218 - 223
  • [43] CD-SYSTEMS OF STATELESS DETERMINISTIC R(1)-AUTOMATA GOVERNED BY AN EXTERNAL PUSHDOWN STORE
    Nagy, Benedek
    Otto, Friedrich
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2011, 45 (04): : 413 - 448
  • [44] Globally deterministic CD-systems of stateless R-automata with window size 1
    Nagy, Benedek
    Otto, Friedrich
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2013, 90 (06) : 1254 - 1277
  • [45] CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
    Benedek Nagy
    Friedrich Otto
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2010, 6031 : 463 - +
  • [46] Time-Optimal Coordination of Flexible Manufacturing Systems Using Deterministic Finite Automata and Mixed Integer Linear Programming
    Kobetski, Avenir
    Fabian, Martin
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2009, 19 (03): : 287 - 315
  • [47] Time-Optimal Coordination of Flexible Manufacturing Systems Using Deterministic Finite Automata and Mixed Integer Linear Programming
    Avenir Kobetski
    Martin Fabian
    Discrete Event Dynamic Systems, 2009, 19 : 287 - 315
  • [48] Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata
    Stewart, Alistair
    Etessami, Kousha
    Yannakakis, Mihalis
    JOURNAL OF THE ACM, 2015, 62 (04)
  • [49] Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
    Ishdorj, Tseren-Onolt
    Leporati, Alberto
    Pan, Linqiang
    Zeng, Xiangxiang
    Zhang, Xingyi
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (25) : 2345 - 2358
12345