Pages that link to "Item:Q5958141"

The following pages link to Topological properties of omega context-free languages (Q5958141):

Displaying 21 items.

• Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic (Q681718) (← links)
• Games with winning conditions of high Borel complexity (Q817850) (← links)
• Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
• Ambiguity in omega context free languages (Q1399989) (← links)
• A hierarchy of deterministic context-free \(\omega\)-languages. (Q1401159) (← links)
• Borel hierarchy and omega context free languages. (Q1401165) (← links)
• Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata (Q1709455) (← links)
• On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
• Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank (Q2219094) (← links)
• Distributed synthesis for regular and contextfree specifications (Q2249664) (← links)
• Classical and effective descriptive complexities of \(\omega \)-powers (Q2271988) (← links)
• The Kolmogorov complexity of infinite words (Q2383593) (← links)
• On some sets of dictionaries whose ω -powers have a given (Q3053226) (← links)
• The Wadge Hierarchy of Petri Nets ω-Languages (Q3455844) (← links)
• Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
• On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
• (Q5028456) (← links)
• On the High Complexity of Petri Nets $$\omega $$-Languages (Q5100750) (← links)
• ω-powers and descriptive set theory (Q5486249) (← links)
• Wadge hierarchy of omega context-free languages (Q5958618) (← links)
• A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)