The following pages link to (Q5192993):
Displaying 8 items.
- Verifying time complexity of Turing machines (Q496007) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← 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)
- Weight-reducing Turing machines (Q6040666) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
- Space Complexity of Stack Automata Models (Q6169902) (← links)
