On ω-sets associated with context-free languages

DOI10.1016/S0019-9958(76)90415-0MaRDI QIDQ4095899zbMATH OpenOpenAlexFDO

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

(16)

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