Similar Items: Ambiguity of {omega}-Languages of Turing Machines
- Alternating Turing machines for inductive languages
- Reachability for infinite time Turing machines with long tapes
- Turing machines on represented sets, a model of computation for Analysis
- Ambiguity Hierarchy of Regular Infinite Tree Languages
- Families of DFAs as Acceptors of $omega$-Regular Languages
- Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable