Pages that link to "Item:Q1210306"
From MaRDI portal
The following pages link to The Borel hierarchy is infinite in the class of regular sets of trees (Q1210306):
Displaying 9 items.
- Regular languages of thin trees (Q290908) (← links)
- Borel hierarchy and omega context free languages. (Q1401165) (← links)
- A gap property of deterministic tree languages. (Q1401364) (← 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)
- Index Problems for Game Automata (Q5278187) (← links)
- An upper bound on the complexity of recognizable tree languages (Q5501862) (← links)