Pages that link to "Item:Q1401159"
From MaRDI portal
The following pages link to A hierarchy of deterministic context-free \(\omega\)-languages. (Q1401159):
Displaying 22 items.
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Borel hierarchy and omega context free languages. (Q1401165) (← links)
- On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
- Logic for \(\omega\)-pushdown automata (Q2064532) (← links)
- Wadge-Wagner hierarchies (Q2074220) (← links)
- Input-driven pushdown automata on well-nested infinite strings (Q2117102) (← links)
- Locally finite \(\omega\)-languages and effective analytic sets have the same topological complexity (Q2827947) (← links)
- The Wadge Hierarchy of Petri Nets ω-Languages (Q3455844) (← links)
- FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES (Q3538855) (← links)
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← links)
- Wadge Degrees of<i>ω</i>-Languages of Deterministic Turing Machines (Q4462679) (← 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)
- Baire reductions and good Borel reducibilities (Q5190204) (← links)
- A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I (Q5321775) (← links)
- A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II (Q5321776) (← links)
- (Q5349417) (← links)
- The determinacy strength of pushdown<i>ω</i>-languages (Q5354436) (← links)
- Topological properties of omega context-free languages (Q5958141) (← links)
- Wadge hierarchy of omega context-free languages (Q5958618) (← links)