Pages that link to "Item:Q1210539"
From MaRDI portal
The following pages link to \(X\)-automata on \(\omega\)-words (Q1210539):
Displaying 23 items.
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Decision problems for Turing machines (Q990079) (← links)
- Finite acceptance of infinite words (Q1269902) (← links)
- On syntactic congruences for \(\omega\)-languages (Q1391139) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Borel hierarchy and omega context free languages. (Q1401165) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063) (← links)
- A note on accelerated Turing machines (Q3061156) (← 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)
- On the Topological Complexity of Infinitary Rational Relations (Q4825475) (← 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)
- Topological properties of omega context-free languages (Q5958141) (← links)
- Wadge hierarchy of omega context-free languages (Q5958618) (← links)