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 条
  • [21] On the descriptional complexity of stateless deterministic ordered restarting automata
    Otto, Friedrich
    Kwee, Kent
    INFORMATION AND COMPUTATION, 2018, 259 : 277 - 302
  • [22] Transductions Computed by One-Dimensional Cellular Automata
    Kutrib, Martin
    Malcher, Andreas
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (90): : 194 - 207
  • [23] Cooperating distributed systems of restarting automata
    Messerschmidt, Hartmut
    Otto, Friedrich
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (06) : 1333 - 1342
  • [24] SYSTEMS OF PARALLEL COMMUNICATING RESTARTING AUTOMATA
    Vollweiler, Marcel
    Otto, Friedrich
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2014, 48 (01): : 3 - 22
  • [25] Deterministic two-way restarting automata and Marcus contextual grammars
    Jurdzinski, T
    Otto, F
    Mráz, F
    Plátek, M
    FUNDAMENTA INFORMATICAE, 2005, 64 (1-4) : 217 - 228
  • [26] On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
    Pardubska, Dana
    Platek, Martin
    Otto, Friedrich
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 660 - +
  • [27] Monotone deterministic RL-automata don't need auxiliary symbols
    Jurdzinski, T
    Mráz, F
    Otto, F
    Plátek, M
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 284 - 295
  • [28] ON CONTROL OF SYSTEMS MODELED AS DETERMINISTIC RABIN AUTOMATA
    THISTLE, JG
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 1995, 5 (04): : 357 - 381
  • [29] CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions
    Otto, Friedrich
    SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 627 - 638
  • [30] Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
    Benedek Nagy
    Friedrich Otto
    Acta Informatica, 2013, 50 : 229 - 255
12345