Classifying Recognizable Infinitary Trace Languages Using Word Automata

DOI10.1007/978-3-662-44522-8_15zbMATH Open1425.68188OpenAlexW117521400MaRDI QIDQ2922012FDOQ2922012

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Notes on finite asynchronous automata
• Deterministic asynchronous automata for infinite traces
• Efficient minimization of deterministic weak \(\omega\)-automata
• Asynchronous cellular automata for infinite traces
• Subspaces of GF(q)ω and convolutional codes
• Automata on Distributed Alphabets
• 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 Q2922012)