Classifying recognizable infinitary trace languages using word automata

DOI10.1007/978-3-662-44522-8_15MaRDI QIDQ2922012zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Classifying recognizable infinitary trace languages using word automata
• Toward a Structure Theory of Regular Infinitary Trace Languages
• scientific article; zbMATH DE number 176496
• scientific article; zbMATH DE number 17820
• Deterministic asynchronous automata for infinite traces

Cites work

• Asynchronous cellular automata for infinite traces
• Automata on distributed alphabets
• Deterministic asynchronous automata for infinite traces
• Efficient minimization of deterministic weak -automata
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• Notes on finite asynchronous automata
• Subspaces of GF(q)ω and convolutional codes
• Toward a Structure Theory of Regular Infinitary Trace Languages

Cited in

(4)

• Classifying recognizable infinitary trace languages using word automata
• An Automata-Theoretical Characterization of Context-Free Trace Languages
• Subclasses of recognizable trace languages
• Toward a Structure Theory of Regular Infinitary Trace Languages

This page was built for publication: Classifying recognizable infinitary trace languages using word automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922012)