The following pages link to (Q3030812):
Displaying 16 items.
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- On a subclass of \(\infty\)-regular languages (Q1104761) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- On an effective hierarchy of communicating processes: Separation principle and testing (Q1269918) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank (Q2219094) (← links)
- Classical and effective descriptive complexities of \(\omega \)-powers (Q2271988) (← links)
- The Kolmogorov complexity of infinite words (Q2383593) (← links)
- Some problems in automata theory which depend on the models of set theory (Q3117545) (← links)
- On the Topological Complexity of Infinitary Rational Relations (Q4825475) (← links)
- Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations (Q4825476) (← links)
