Toward a Structure Theory of Regular Infinitary Trace Languages

DOI10.1007/978-3-662-43951-7_12zbMATH Open1409.68154OpenAlexW43892872MaRDI QIDQ5167833

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

Could not fetch data.

Related Items (2)

Classifying Recognizable Infinitary Trace Languages Using Word Automata ⋮ Classifying recognizable infinitary trace languages using word automata

Recommendations

• On regular trace languages 👍 👎
• On some structural properties of a subclass of \(\infty\)-regular languages 👍 👎
• 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 👍 👎
• Characterizations of the decidability of some problems for regular trace languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)