Toward a Structure Theory of Regular Infinitary Trace Languages

DOI10.1007/978-3-662-43951-7_12MaRDI QIDQ5167833zbMATH OpenOpenAlexFDO

Authors Namit Chaturvedi

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43951-7_12

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

• scientific article; zbMATH DE number 176739
• On regular trace languages
• Characterizations of the decidability of some problems for regular trace languages
• scientific article; zbMATH DE number 176496
• scientific article; zbMATH DE number 4020497
• On some structural properties of a subclass of \(\infty\)-regular languages
• Trace languages definable with modular quantifiers
• Classifying recognizable infinitary trace languages using word automata
• Classifying recognizable infinitary trace languages using word automata
• An Automata-Theoretical Characterization of Context-Free Trace Languages

Cited in

(4)

• An extension of Kleene's and Ochmański's theorems to infinite traces
• Classifying recognizable infinitary trace languages using word automata
• Classifying recognizable infinitary trace languages using word automata
• scientific article; zbMATH DE number 512867 (Why is no real title available?)

This page was built for publication: Toward a Structure Theory of Regular Infinitary Trace Languages

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