Pages that link to "Item:Q5096738"
From MaRDI portal
The following pages link to Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time (Q5096738):
Displaying 8 items.
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Fine hierarchy of regular \(\omega\)-languages (Q1127312) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
- Wadge-Wagner hierarchies (Q2074220) (← links)
- Complexity of Topological Properties of Regular ω-Languages (Q3533038) (← links)
- Topological properties of omega context-free languages (Q5958141) (← links)
- Wadge hierarchy of omega context-free languages (Q5958618) (← links)