The following pages link to (Q3976039):
Displaying 11 items.
- Automaticity. IV: Sequences, sets, and diversity (Q679096) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- Hartmanis-Stearns Conjecture on Real Time and Transcendence (Q2891306) (← links)
- Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines (Q3172836) (← links)
- Complexity of probabilistic versus deterministic automata (Q4560366) (← links)
- Lower space bounds for randomized computation (Q4632458) (← links)
- Lower time bounds for randomized computation (Q4645177) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)
- Minimal cover-automata for finite languages (Q5958721) (← links)
