On the Computational Capacity of Parallel Communicating Finite Automata-Reference-Cited by-同舟云学术

On the Computational Capacity of Parallel Communicating Finite Automata

Published: Issue: Volume: Page:146-157
ISSN:0302-9743
Container-title:Developments in Language Theory
language:
Short-container-title:

Author:

Bordihn Henning,Kutrib Martin,Malcher Andreas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-85780-8_11.pdf

Reference15 articles.

1. Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30, 323–342 (1983)

2. Buda, A.: Multiprocessor automata. Inform. Process. Lett. 25, 257–261 (1987)

3. Choudhary, A., Krithivasan, K., Mitrana, V.: Returning and non-returning parallel communicating finite automata are equivalent. RAIRO Inform. Théor. 41, 137–145 (2007)

4. Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, Yverdon (1994)

5. Lecture Notes in Computer Science;P. Ďuriš,1998

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Network Topologies for Parallel Communicating Finite Automata: Token-Ring and Token-Bus;Lecture Notes in Computer Science;2024

2. Systems of parallel communicating restarting automata;RAIRO - Theoretical Informatics and Applications;2014-01

3. UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA;International Journal of Foundations of Computer Science;2011-11

4. Undecidability and Hierarchy Results for Parallel Communicating Finite Automata;Developments in Language Theory;2010