-computations on Turing machines
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3229502 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decision problems forω-automata
- On the Computational Complexity of Algorithms
- On ω-sets associated with context-free languages
- Testing and generating infinite sequences by a finite automaton
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Theory of -languages. I: Characterizations of -context- free languages
- Theory of -languages. II: A study of various models of - type generation and recognition
- -computations on deterministic pushdown machines
Cited in
(30)- The Wadge hierarchy of Petri nets \(\omega\)-languages
- A note on accelerated Turing machines
- Computation as an unbounded process
- Infinite behaviour of Petri nets
- ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES
- Highly Undecidable Problems For Infinite Computations
- Decision problems for Turing machines
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
- Computability and realizability for interactive computations
- Index sets in computable analysis
- Sequential mappings of $\omega $-languages
- Locally finite \(\omega\)-languages and effective analytic sets have the same topological complexity
- The exact complexity of the infinite Post Correspondence Problem
- \(X\)-automata on \(\omega\)-words
- Theory of -languages. II: A study of various models of - type generation and recognition
- Theory of -languages. I: Characterizations of -context- free languages
- Infinite games specified by 2-tape automata
- Three applications to rational relations of the high undecidability of the infinite Post correspondence problem in a regular \(\omega\)-language
- Alternating finite automata on -words
- Supertasks do not increase computational power
- Real functions and numbers defined by Turing machines
- On the complexity of -type Turing acceptors
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
- Somewhat finite approaches to infinite sentences.
- Init and Anf operating on \(\omega\)-languages
- Effectively closed sets and graphs of computable real functions.
- Some problems in automata theory which depend on the models of set theory
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
- On the high complexity of Petri nets \(\omega \)-languages
- Polishness of some topologies related to word or tree automata
This page was built for publication: \(\omega\)-computations on Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242685)
