Measuring communication in parallel communicating finite automata

MaRDI QIDQ4994939zbMATH OpenFDO

Authors Martin Kutrib, Andreas Malcher, Henning Bordihn

Publication date 22 June 2021

Full work available at URL https://arxiv.org/abs/1405.5600, http://eptcs.web.cse.unsw.edu.au/paper.cgi?AFL2014.8

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Formal languages and automata (68Q45)

Recommendations

• Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
• scientific article; zbMATH DE number 1502112
• On the Computational Capacity of Parallel Communicating Finite Automata
• Measuring communication in automata systems (invited paper)
• On the computational capacity of parallel communicating finite automata

Cited in

(15)

• Communicating automata
• Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
• Asynchronous systems of parallel communicating finite automata
• On the computational capacity of parallel communicating finite automata
• Measuring communication in automata systems (invited paper)
• Two-party Watson-Crick computations
• On the Computational Capacity of Parallel Communicating Finite Automata
• Undecidability and hierarchy results for parallel communicating finite automata
• scientific article; zbMATH DE number 1490952 (Why is no real title available?)
• scientific article; zbMATH DE number 1502112 (Why is no real title available?)
• 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?)
• Characterizing the decidability of finite state automata team games with communication
• Network topologies for parallel communicating finite automata: token-ring and token-bus

This page was built for publication: Measuring communication in parallel communicating finite automata

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