Measuring communication in automata systems (invited paper)

DOI10.1007/978-3-319-09698-8_23MaRDI QIDQ2921990zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Andreas Malcher

Publication date 14 October 2014

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09698-8_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Measuring communication in parallel communicating finite automata
• scientific article; zbMATH DE number 1502112
• Cellular automata with sparse communication
• Cellular Automata with Sparse Communication
• scientific article; zbMATH DE number 1754655

Cited in

(8)

• scientific article; zbMATH DE number 1405691 (Why is no real title available?)
• Cellular Automata with Sparse Communication
• Asynchronous communicating cellular automata: formalization, robustness and equivalence
• scientific article; zbMATH DE number 1754655 (Why is no real title available?)
• Minimizing evolution communication P systems and automata
• On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels
• Two-party Watson-Crick computations
• Measuring communication in parallel communicating finite automata

This page was built for publication: Measuring communication in automata systems (invited paper)

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