Pages that link to "Item:Q1247962"

The following pages link to \(\omega\)-computations on deterministic pushdown machines (Q1247962):

Displaying 23 items.

• Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
• Valuations of languages, with applications to fractal geometry (Q674334) (← links)
• Finite-state \(\omega\)-languages (Q794443) (← links)
• Alternating finite automata on \(\omega\)-words (Q796990) (← links)
• Games with winning conditions of high Borel complexity (Q817850) (← links)
• Real functions and numbers defined by Turing machines (Q1050122) (← links)
• Init and Anf operating on \(\omega\)-languages (Q1056238) (← links)
• On the complexity of \(\omega\)-type Turing acceptors (Q1138912) (← links)
• \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages (Q1240574) (← links)
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition (Q1240575) (← links)
• \(\omega\)-computations on Turing machines (Q1242685) (← links)
• Somewhat finite approaches to infinite sentences. (Q1353892) (← 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)
• On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
• Distributed synthesis for regular and contextfree specifications (Q2249664) (← links)
• The exact complexity of the infinite Post Correspondence Problem (Q2345861) (← links)
• Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
• (Q5028456) (← links)
• Topological properties of omega context-free languages (Q5958141) (← links)
• Wadge hierarchy of omega context-free languages (Q5958618) (← links)