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
关键词
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 条
  • [1] On nonforgetting restarting automata that are deterministic and/or monotone
    Messerschmidt, Hartmut
    Otto, Friedrich
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 247 - 258
  • [2] On left-monotone deterministic restarting automata
    Jurdzinski, T
    Otto, F
    Mráz, F
    Plátek, M
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 249 - 260
  • [3] A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata
    Hartmut Messerschmidt
    Friedrich Otto
    Theory of Computing Systems, 2011, 48 : 343 - 373
  • [4] A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata
    Messerschmidt, Hartmut
    Otto, Friedrich
    THEORY OF COMPUTING SYSTEMS, 2011, 48 (02) : 343 - 373
  • [5] ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
    Messerschmidt, Hartmut
    Otto, Friedrich
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2009, 20 (01) : 185 - 209
  • [6] On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract)
    Schluter, Natalie
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 440 - 441
  • [7] Strictly deterministic CD-systems of restarting automata
    Messerschmidt, H.
    Otto, F.
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2007, 4639 : 424 - +
  • [8] On stateless deterministic restarting automata
    Martin Kutrib
    Hartmut Messerschmidt
    Friedrich Otto
    Acta Informatica, 2010, 47 : 391 - 412
  • [9] On Stateless Deterministic Restarting Automata
    Kutrib, Martin
    Messerschmidt, Hartmut
    Otto, Friedrich
    SOFSEM 2009-THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2009, 5404 : 353 - +
  • [10] On stateless deterministic restarting automata
    Kutrib, Martin
    Messerschmidt, Hartmut
    Otto, Friedrich
    ACTA INFORMATICA, 2010, 47 (7-8) : 391 - 412