Topology for Computations of Concurrent Automata

DOI10.1142/S021819679800017XzbMath0923.68091MaRDI QIDQ4354233

R. M. Shortt, Dietrich Kuske

Publication date: 15 September 1997

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

topologyinfinite computations of concurrent automata

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cites Work

• Recognizable languages in concurrency monoids
• Star-free trace languages
• Representation of computations in concurrent automata by dependence orders
• Labelled domains and automata with concurrency
• Weak Second‐Order Arithmetic and Finite Automata
• On the definition of a family of automata
• Dependence orders for computations of concurrent automata
• On finite monoids having only trivial subgroups

This page was built for publication: Topology for Computations of Concurrent Automata