Pages that link to "Item:Q3422021"
From MaRDI portal
The following pages link to Borel ranks and Wadge degrees of context free $\omega$-languages (Q3422021):
Displayed 19 items.
- Infinite games specified by 2-tape automata (Q324245) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Wadge-Wagner hierarchies (Q2074220) (← links)
- Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank (Q2219094) (← links)
- Classical and effective descriptive complexities of \(\omega \)-powers (Q2271988) (← links)
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063) (← links)
- Locally finite ω-languages and effective analytic sets have the same topological complexity (Q2827947) (← links)
- Some problems in automata theory which depend on the models of set theory (Q3117545) (← links)
- Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (Q3449478) (← links)
- The Wadge Hierarchy of Petri Nets ω-Languages (Q3455844) (← links)
- On the continuity set of an Omega rational function (Q3514642) (← links)
- Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← 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)
- Polishness of some topologies related to word or tree automata (Q5376660) (← links)
- (Q6070608) (← links)