Classifying recognizable infinitary trace languages using word automata

DOI10.1016/J.IC.2017.04.006MaRDI QIDQ2407086zbMATH OpenOpenAlexFDO

Authors Namit Chaturvedi, Marcus Gelderie

Publication date 28 September 2017

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2017.04.006

zbMATH Keywords

classificationfinite state automataMazurkiewicz tracesomega-regular languages

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• Asynchronous cellular automata for infinite traces
• Automata and semigroups recognizing infinite words
• Automata on distributed alphabets
• Classifying recognizable infinitary trace languages using word automata
• Deterministic asynchronous automata for infinite traces
• Efficient minimization of deterministic weak -automata
• Finite-state \(\omega\)-languages
• Notes on finite asynchronous automata
• Toward a Structure Theory of Regular Infinitary Trace Languages

Cited in

(4)

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

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 Q2407086)