Determinizing asynchronous automata

DOI10.1007/3-540-58201-0_63zbMath1422.68153OpenAlexW1565703711MaRDI QIDQ4632421

No author found.

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_63

Mathematics Subject Classification ID

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

Related Items

A quadratic construction for Zielonka automata with acyclic communication structure ⋮ Keeping track of the latest gossip in a distributed system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronous mappings and asynchronous cellular automata
• Determinizing Büchi asynchronous automata
• Notes on finite asynchronous automata
• On the complementation of Büchi asynchronous cellular automata
• Asynchronous cellular automata for infinite traces