Two-way unary automata versus logarithmic space

References

Page 1

	Year	Citations
Introduction to automata theory, languages and computation Mathematics and Computers in Simulation Logical AutomatonEngineeringAutomated ReasoningFormal MethodsAutomaton Network	1981	10.8K
Introduction to automata theory, languages, and computation Computer Languages Logical AutomatonEngineeringAutomated ReasoningFormal MethodsAutomaton Network	1980	6.8K
Finite Automata and Their Decision Problems M. O. Rabin, D. Scott IBM Journal of Research and Development Logical AutomatonEngineeringAutomaton NetworkAutomated ReasoningOne-tape Automaton	1959	1.9K
Relationships between nondeterministic and deterministic tape complexities Walter J. Savitch Journal of Computer and System Sciences Deterministic SystemEngineeringEntropyComputational ComplexityProbability Theory	1970	1.4K
Space-bounded reducibility among combinatorial problems Neil D. Jones Journal of Computer and System Sciences EngineeringCombinatorial ProblemComputational ComplexityDiscrete MathematicsCombinatorial Optimization	1975	362
The Reduction of Two-Way Automata to One-Way Automata J. C. Shepherdson IBM Journal of Research and Development Input TapeLogical AutomatonEngineeringAutomated ReasoningFormal Methods	1959	301
Finite automata and unary languages Marek Chrobák Theoretical Computer Science Unary LanguagesLogical AutomatonEngineeringAutomated ReasoningFormal Methods	1986	293
Nondeterminism and the size of two way finite automata William J. Sakoda, Michael Sipser Theory Of ComputingComputingmay 1978EngineeringQuantum AutomatonData Science	1978	172
TURING MACHINES THAT TAKE ADVICE E-Periodica	1982	121
Making Nondeterminism Unambiguous Klaus Reinhardt, Eric Allender SIAM Journal on Computing Computational Complexity TheoryEngineeringComplexity ClassesComputational ComplexitySemantics	2000	105

Page 1