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 条
  • [11] Hierarchies of weakly monotone restarting automata
    Mráz, F
    Otto, F
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2005, 39 (02): : 325 - 342
  • [12] On the complexity of 2-monotone restarting automata
    Jurdzinski, T
    Otto, F
    Mráz, F
    Plátek, M
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 237 - 248
  • [13] On the complexity of 2-monotone restarting automata
    Jurdzinski, Tomasz
    Otto, Friedrich
    Mraz, Frantiek
    Platek, Martin
    THEORY OF COMPUTING SYSTEMS, 2008, 42 (04) : 488 - 518
  • [14] On the Complexity of 2-Monotone Restarting Automata
    Tomasz Jurdziński
    Friedrich Otto
    František Mráz
    Martin Plátek
    Theory of Computing Systems, 2008, 42 : 488 - 518
  • [15] Deterministic Ordered Restarting Automata that Compute Functions
    Otto, Friedrich
    Kwee, Kent
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 401 - 412
  • [16] On the Descriptional Complexity of Deterministic Ordered Restarting Automata
    Otto, Friedrich
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 318 - 329
  • [17] Deterministic ordered restarting automata for picture languages
    Otto, Friedrich
    Mraz, Frantisek
    ACTA INFORMATICA, 2015, 52 (7-8) : 593 - 623
  • [18] Deleting Deterministic Restarting Automata with Two Windows
    Mraz, Frantisek
    Otto, Friedrich
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017, 2017, 10396 : 272 - 283
  • [19] Deterministic ordered restarting automata for picture languages
    Friedrich Otto
    František Mráz
    Acta Informatica, 2015, 52 : 593 - 623
  • [20] On Lexicalized Well-Behaved Restarting Automata That Are Monotone
    Otto, Friedrich
    Platek, Martin
    Mraz, Frantisek
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 352 - +
12345