Efficient simulation of synchronous systems by multi-speed systems

DOI10.1051/ITA:2005025MaRDI QIDQ3025325zbMATH OpenOpenAlexFDO

Authors Tomasz Jurdziński, Mirosław Kutyłowski, J. Zatopiański

Publication date 13 July 2005

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2005__39_2_403_0, http://www.numdam.org/item?id=ITA_2005__39_2_403_0/, https://eudml.org/doc/244997

zbMATH Keywords

communication complexitymessage complexitymulti-head automatasystems of finite automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1795910
• scientific article; zbMATH DE number 1696468
• Asynchronous systems of parallel communicating finite automata
• Efficiency of Synchronous Versus Asynchronous Distributed Systems
• scientific article; zbMATH DE number 1405691

Cites work

• A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
• Communication-Space Tradeoffs for Unrestricted Protocols
• scientific article; zbMATH DE number 1754655 (Why is no real title available?)
• scientific article; zbMATH DE number 1795910 (Why is no real title available?)
• scientific article; zbMATH DE number 1405691 (Why is no real title available?)
• Some undecidable problems for parallel communicating finite automata systems

Cited in

(1)

• A unified approach to models of synchronous parallel machines

This page was built for publication: Efficient simulation of synchronous systems by multi-speed systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3025325)