The following pages link to (Q5192993):
Displaying 19 items.
- Verifying time complexity of Turing machines (Q496007) (← links)
- A note on off-line machines with 'Brownian' input heads (Q801900) (← links)
- The complexity of matrix transposition on one-tape off-line Turing machines (Q808247) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← links)
- An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577) (← links)
- Element distinctness on one-tape Turing machines: a complete solution (Q1889761) (← links)
- Verifying whether one-tape Turing machines run in linear time (Q2009635) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- (Q3751009) (← links)
- (Q4218136) (← links)
- Space Complexity of Stack Automata Models (Q5041255) (← links)
- Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences (Q5200101) (← links)
- Element Distinctness and Sorting on One-Tape Off-Line Turing Machines (Q5448667) (← links)
- Linear-time limited automata (Q5919709) (← links)
- Weight-reducing Turing machines (Q6040666) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
- Space Complexity of Stack Automata Models (Q6169902) (← links)