Similar Items: Reachability for infinite time Turing machines with long tapes
- Alternating Turing machines for inductive languages
- Ambiguity of {omega}-Languages of Turing Machines
- Turing machines on represented sets, a model of computation for Analysis
- Reachability and liveness in parametric timed automata
- Bounded Reachability Problems are Decidable in FIFO Machines
- Strong Turing Degrees for Additive BSS RAM's