Classifying Recognizable Infinitary Trace Languages Using Word Automata

DOI10.1007/978-3-662-44522-8_15zbMath1425.68188OpenAlexW117521400MaRDI QIDQ2922012

Namit Chaturvedi, Marcus Gelderie

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44522-8_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Classifying recognizable infinitary trace languages using word automata

Cites Work

• Unnamed Item
• Unnamed Item
• Deterministic asynchronous automata for infinite traces
• Efficient minimization of deterministic weak \(\omega\)-automata
• Subspaces of GF(q)ω and convolutional codes
• Notes on finite asynchronous automata
• Automata on Distributed Alphabets
• Toward a Structure Theory of Regular Infinitary Trace Languages
• Asynchronous cellular automata for infinite traces

This page was built for publication: Classifying Recognizable Infinitary Trace Languages Using Word Automata