Pages that link to "Item:Q3809783"
From MaRDI portal
The following pages link to Nondeterministic Ω-Computations and the Analytical Hierarchy (Q3809783):
Displaying 9 items.
- Infinite games specified by 2-tape automata (Q324245) (← links)
- Decision problems for Turing machines (Q990079) (← links)
- Locally finite ω-languages and effective analytic sets have the same topological complexity (Q2827947) (← links)
- Classes of Timed Automata and the Undecidability of Universality (Q2842589) (← links)
- On the complexity of stream equality (Q2875229) (← links)
- Some problems in automata theory which depend on the models of set theory (Q3117545) (← links)
- Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- On the High Complexity of Petri Nets $$\omega $$-Languages (Q5100750) (← links)
