Returning and non-returning parallel communicating finite automata are equivalent

被引：12
|
作者：
Choudhary, Ashish [1 ]
Krithivasan, Kamala
Mitrana, Victor
机构：
[1] Indian Inst Technol, Dept Comp Sci & Engn, Madras 600036, Tamil Nadu, India
[2] Univ Bucharest, Fac Math & Comp Sci, Bucharest 010014, Romania
[3] Univ Rovira & Virgili, Res Grp Math Linguist, Tarragona 43005, Spain
来源：
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS | 2007年 / 41卷 / 02期
关键词：
formal languages; parallel communicating finite automata system; multihead finite automaton; computational power;
D O I：
10.1051/ita:2007014
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A parallel communicating automata system consists of several automata working independently in parallel and communicating with each other by request with the aim of recognizing a word. Rather surprisingly, returning parallel communicating finite automata systems are equivalent to the non- returning variants. We show this result by proving the equivalence of both with multihead finite automata. Some open problems are finally formulated.
引用
收藏
页码：137 / 145
页数：9
相关论文
共 50 条
  • [21] On the Computational Capacity of Parallel Communicating Finite Automata
    Bordihn, Henning
    Kutrib, Martin
    Malcher, Andreas
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 146 - +
  • [22] Reversible parallel communicating finite automata systems
    Bordihn, Henning
    Vaszil, Gyorgy
    ACTA INFORMATICA, 2021, 58 (04) : 263 - 279
  • [23] Asynchronous Systems of Parallel Communicating Finite Automata
    Vollweiler, Marcel
    FUNDAMENTA INFORMATICAE, 2015, 136 (1-2) : 177 - 197
  • [24] ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA
    Bordihn, Henning
    Kutrib, Martin
    Malcher, Andreas
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (03) : 713 - 732
  • [25] Reversible parallel communicating finite automata systems
    Henning Bordihn
    György Vaszil
    Acta Informatica, 2021, 58 : 263 - 279
  • [26] Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
    Jiraskova, Galina
    Mlynarcik, Peter
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 222 - 233
  • [27] Undecidability and Hierarchy Results for Parallel Communicating Finite Automata
    Bordihn, Henning
    Kutrib, Martin
    Malcher, Andreas
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 88 - +
  • [28] UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA
    Bordihn, Henning
    Kutrib, Martin
    Malcher, Andreas
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (07) : 1577 - 1592
  • [29] Some undecidable problems for parallel communicating finite automata systems
    Martín-Vide, C
    Mitrana, V
    INFORMATION PROCESSING LETTERS, 2001, 77 (5-6) : 239 - 245
  • [30] Morphological analysis and radiocarbon dating of non-returning boomerangs from Cooper Creek/Kinipapa (Northeast South Australia)
    Roberts, Amy
    Freeman, Sean
    Wesley, Daryl
    Levchenko, Vladimir
    Barry, Linda
    Bordes, Luc
    Litherland, Katheryn
    Litherland, Jason
    Haynes, Joshua
    Paterson, Aaron
    AUSTRALIAN ARCHAEOLOGY, 2022, 88 (01) : 31 - 48
12345