Nondeterministic Ω-Computations and the Analytical Hierarchy
From MaRDI portal
Publication:3809783
Recommendations
Cited in
(11)- scientific article; zbMATH DE number 1836415 (Why is no real title available?)
- Highly Undecidable Problems For Infinite Computations
- Decision problems for Turing machines
- Locally finite \(\omega\)-languages and effective analytic sets have the same topological complexity
- Classes of timed automata and the undecidability of universality
- Infinite games specified by 2-tape automata
- On the Herbrand-Kleene universe for nondeterministic computations
- On the complexity of stream equality
- Some problems in automata theory which depend on the models of set theory
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
- On the high complexity of Petri nets \(\omega \)-languages
This page was built for publication: Nondeterministic Ω-Computations and the Analytical Hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3809783)