2-asynchronous automata

DOI10.1016/0304-3975(88)90110-7zbMath0655.68069OpenAlexW2076127848MaRDI QIDQ1109571

Eric Sopena, Yves Roos, Michel Latteux, Robert Cori

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90110-7

zbMATH Keywords

finite automataconcurrent processesasynchronous automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Asynchronous automata versus asynchronous cellular automata ⋮ Recognizable trace languages, distributed automata and the distribution problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal serializability of iterated transactions
• Semi-commutations
• Recognizable subsets of some partially Abelian monoids
• Notes on finite asynchronous automata

This page was built for publication: 2-asynchronous automata