Pages that link to "Item:Q1240575"

The following pages link to Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition (Q1240575):

Displaying 17 items.

• Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
• Alternating finite automata on \(\omega\)-words (Q796990) (← links)
• Safety and liveness of \(\omega\)-context-free languages (Q811129) (← links)
• Real functions and numbers defined by Turing machines (Q1050122) (← links)
• Init and Anf operating on \(\omega\)-languages (Q1056238) (← links)
• On a subclass of \(\infty\)-regular languages (Q1104761) (← links)
• On the complexity of \(\omega\)-type Turing acceptors (Q1138912) (← links)
• On direct products of automaton decidable theories (Q1168306) (← links)
• \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages (Q1240574) (← links)
• \(\omega\)-computations on Turing machines (Q1242685) (← links)
• \(\omega\)-computations on deterministic pushdown machines (Q1247962) (← links)
• Somewhat finite approaches to infinite sentences. (Q1353892) (← links)
• Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
• Computability and realizability for interactive computations (Q2343137) (← links)
• Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
• (Q5028456) (← links)