On ω-sets associated with context-free languages
From MaRDI portal
Publication:4095899
DOI10.1016/S0019-9958(76)90415-0zbMath0329.68066OpenAlexW2040935142MaRDI QIDQ4095899
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
Related Items (13)
On omega context free languages which are Borel sets of infinite rank. ⋮ On the complexity of \(\omega\)-type Turing acceptors ⋮ Ambiguity in omega context free languages ⋮ Borel hierarchy and omega context free languages. ⋮ Model checking probabilistic systems against pushdown specifications ⋮ \(X\)-automata on \(\omega\)-words ⋮ A decidability result for deterministic \(\omega\)-context-free languages ⋮ Topological properties of omega context-free languages ⋮ Wadge hierarchy of omega context-free languages ⋮ \(\omega\)-computations on Turing machines ⋮ Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes ⋮ Finite-state \(\omega\)-languages ⋮ On infinite words obtained by selective substitution grammars
This page was built for publication: On ω-sets associated with context-free languages
