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
来源
关键词
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 条
  • [41] Returning to the Same Point through Bounded Controls in Finite Time
    Choque-Rivero, Abdon E.
    Mullisaca, Efrain Cruz
    Gonzalez, Graciela A.
    2022 IEEE INTERNATIONAL AUTUMN MEETING ON POWER, ELECTRONICS AND COMPUTING (ROPEC), 2022,
  • [42] Parallel communicating Watson-Crick automata systems
    Department of Mathematics, University of Turku, Turku Centre for Computer Science, Turku 20520, Finland
    Acta Cybern, 2006, 4 (685-700):
  • [43] Parallel Communicating Watson-Crick Automata Systems
    Czeizler, Elena
    Czeizler, Eugen
    ACTA CYBERNETICA, 2006, 17 (04): : 685 - 700
  • [44] Priority and Non-priority services: returning to the origins?
    Silva, Filipa
    MULTI-MODAL COMPETITION AND THE FUTURE OF MAIL, 2012, : 303 - 315
  • [45] Parallel communicating finite transducer systems
    Csuhaj-Varjú, E
    Martín-Vide, C
    Mitrana, V
    COMPUTATIONAL LINGUISTICS IN THE NETHERLANDS 2002, 2003, (47): : 9 - 23
  • [46] The non-existance of a current returning in vocal emission
    Bonnier, P
    COMPTES RENDUS DES SEANCES DE LA SOCIETE DE BIOLOGIE ET DE SES FILIALES, 1900, 52 : 1126 - 1127
  • [47] Non-regular unary language and parallel communicating Watson-Crick automata systems
    Chatterjee, Kingshuk
    Ray, Kumar Sankar
    THEORETICAL COMPUTER SCIENCE, 2018, 705 : 113 - 117
  • [48] On Parallel Implementations of Deterministic Finite Automata
    Holub, Jan
    Stekr, Stanislav
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2009, 5642 : 54 - 64
  • [49] On Parallel Versions of Jumping Finite Automata
    Kocman, Radim
    Meduna, Alexander
    PROCEEDINGS OF THE 2015 FEDERATED CONFERENCE ON SOFTWARE DEVELOPMENT AND OBJECT TECHNOLOGIES, 2017, 511 : 142 - 149
  • [50] Pipelined Parallel Finite Automata Evaluation
    Sateesh, Vipula
    Mckeon, Connor
    Winograd, Jared
    DeHon, Andre
    2019 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY (ICFPT 2019), 2019, : 108 - 116