Pages that link to "Item:Q1242685"

The following pages link to \(\omega\)-computations on Turing machines (Q1242685):

Displaying 30 items.

• Infinite games specified by 2-tape automata (Q324245) (← links)
• Computation as an unbounded process (Q418791) (← links)
• Alternating finite automata on \(\omega\)-words (Q796990) (← links)
• Decision problems for Turing machines (Q990079) (← 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)
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes (Q1249573) (← links)
• Index sets in computable analysis (Q1292400) (← links)
• Somewhat finite approaches to infinite sentences. (Q1353892) (← links)
• Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
• Supertasks do not increase computational power (Q1761709) (← links)
• Infinite behaviour of Petri nets (Q2265817) (← links)
• Computability and realizability for interactive computations (Q2343137) (← links)
• The exact complexity of the infinite Post Correspondence Problem (Q2345861) (← 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)
• A note on accelerated Turing machines (Q3061156) (← links)
• Some problems in automata theory which depend on the models of set theory (Q3117545) (← links)
• The Wadge Hierarchy of Petri Nets ω-Languages (Q3455844) (← links)
• Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
• Sequential mappings of $\omega $-languages (Q3773367) (← links)
• ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES (Q4652792) (← 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)