Probabilistic asynchronous automata

DOI10.1007/BF01201811zbMath0840.68079MaRDI QIDQ4864443

Giovanni Pighizzini, S. Jesi, Nicoletta Sabadini

Publication date: 1 July 1996

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

asynchronous automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Asynchronous automata versus asynchronous cellular automata ⋮ A Theory of Distributed Markov Chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of traces
• Combinatorics on traces
• On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
• Membership problems for regular and context-free trace languages
• Combinatorial problems of commutation and rearrangements
• Notes on finite asynchronous automata
• An extension of the notions of traces and of asynchronous automata
• On m-adic probabilistic automata
• Probabilistic automata

This page was built for publication: Probabilistic asynchronous automata