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 条
12345