论文信息 - Lower Bounds on the Size of Sweeping Automata

Lower Bounds on the Size of Sweeping Automata

Abstract A sweeping automaton is a deterministic two-way finite automaton which only changes head direction at the ends of the input tape. It is shown that for every n , there is a language which is accepted by an n -state nondeterministic one-way finite automaton, yet which is not accepted by any sweeping automaton with fewer than 2 n states.

Michael Sipser

[1] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[2] A. R. Meyer,et al. Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[3] William J. Sakoda,et al. Nondeterminism and the size of two way finite automata , 1978, STOC.

[4] E. M. Schmidt. Succinctness of Descriptions of Context-Free, Regular and Finite Languages , 1977 .

[5] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.