Pages that link to "Item:Q3625697"
From MaRDI portal
The following pages link to Highly Undecidable Problems For Infinite Computations (Q3625697):
Displaying 14 items.
- Infinite games specified by 2-tape automata (Q324245) (← links)
- Infinity problems and countability problems for \(\omega \)-automata (Q845856) (← links)
- Reasoning about infinite computations (Q1341752) (← links)
- Locally finite \(\omega\)-languages and effective analytic sets have the same topological complexity (Q2827947) (← links)
- Undecidability of infinite Post correspondence problem for instances of size 8 (Q2905329) (← links)
- Some problems in automata theory which depend on the models of set theory (Q3117545) (← links)
- Undecidability of infinite post correspondence problem for instances of Size 9 (Q3423136) (← links)
- The Wadge Hierarchy of Petri Nets ω-Languages (Q3455844) (← links)
- Nondeterministic Ω-Computations and the Analytical Hierarchy (Q3809783) (← links)
- Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations (Q4825476) (← links)
- THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE (Q4923292) (← 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)
- Two Effective Properties of ω-Rational Functions (Q6169907) (← links)