Pages that link to "Item:Q5444966"
From MaRDI portal
The following pages link to On the Topological Complexity of Weakly Recognizable Tree Languages (Q5444966):
Displaying 10 items.
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Wadge-Wagner hierarchies (Q2074220) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- On the Weak Index Problem for Game Automata (Q2947463) (← links)
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← links)
- On the Strength of Unambiguous Tree Automata (Q4683238) (← links)
- A Characterisation of Pi^0_2 Regular Tree Languages (Q5111272) (← links)
- Regular tree languages in low levels of the Wadge hierarchy (Q5232909) (← links)
- Index Problems for Game Automata (Q5278187) (← links)
- A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2] (Q5500683) (← links)