scientific article
From MaRDI portal
Publication:3030812
zbMath0627.03024MaRDI QIDQ3030812
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
recursive operatorsBorel hierarchyarithmetical hierarchyrecursive \(\omega \)-languagessets of infinite words accepted by Turing machines
Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10) Hierarchies of computability and definability (03D55)
Related Items (max. 100)
On omega context free languages which are Borel sets of infinite rank. ⋮ Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ The Wadge Hierarchy of Petri Nets ω-Languages ⋮ The Kolmogorov complexity of infinite words ⋮ Towards a descriptive set theory for domain-like structures ⋮ On a subclass of \(\infty\)-regular languages ⋮ On the Topological Complexity of Infinitary Rational Relations ⋮ Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations ⋮ Ambiguity in omega context free languages ⋮ Sequential mappings of $\omega $-languages ⋮ On the continuity set of an Omega rational function ⋮ Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ \(X\)-automata on \(\omega\)-words ⋮ Classical and effective descriptive complexities of \(\omega \)-powers ⋮ Topological properties of omega context-free languages ⋮ Wadge hierarchy of omega context-free languages ⋮ Highly Undecidable Problems For Infinite Computations ⋮ On an effective hierarchy of communicating processes: Separation principle and testing ⋮ Index sets in computable analysis ⋮ Some problems in automata theory which depend on the models of set theory ⋮ Effectively closed sets and graphs of computable real functions.
This page was built for publication:
