On a subclass of \(\infty\)-regular languages

DOI10.1016/0304-3975(88)90105-3zbMath0647.68075OpenAlexW112693406MaRDI QIDQ1104761

Ivan Mezník

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90105-3

zbMATH Keywords

\(\infty \)-regular languagesG-languagesG-machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Theories of automata on \(\omega\)-tapes: a simplified approach
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
• Fixed-point characterization of context-free ∞-languages
• Sets constructed by acceptors
• Generable sets
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• G-machines and generable sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a subclass of \(\infty\)-regular languages