On ω-sets associated with context-free languages

DOI10.1016/S0019-9958(76)90415-0zbMATH Open0329.68066OpenAlexW2040935142MaRDI QIDQ4095899FDOQ4095899

Authors: Matti Linna 

Publication date: 1976

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(76)90415-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (14)

• Topological properties of omega context-free languages
• Model checking probabilistic systems against pushdown specifications
• Borel hierarchy and omega context free languages.
• On omega context free languages which are Borel sets of infinite rank.
• Quantum Büchi automata
• \(X\)-automata on \(\omega\)-words
• On infinite words obtained by selective substitution grammars
• Finite-state \(\omega\)-languages
• \(\omega\)-computations on Turing machines
• On the complexity of \(\omega\)-type Turing acceptors
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• A decidability result for deterministic \(\omega\)-context-free languages
• Wadge hierarchy of omega context-free languages
• Ambiguity in omega context free languages

This page was built for publication: On ω-sets associated with context-free languages

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