Lower bounds on the size of sweeping automata

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

Relationships between nondeterministic and deterministic tape complexities

Walter J. Savitch · Journal of Computer and System Sciences · 1970 · 1.4K citations

Computing, Computer Science, Algorithms +5

Economy of description by automata, grammars, and formal systems

Albert R. Meyer, Michael J. Fischer · 1971 · 322 citations

Computing, Computer Engineering, Computer Science +12

Nondeterminism and the size of two way finite automata

William J. Sakoda, Michael Sipser · 1978 · 172 citations · Full text

Computing, Computer Science, Dynamical Systems +10

Succinctness of Descriptions of Context-Free, Regular, and Finite Languages

Erik M. Schmidt · DAIMI Report Series · 1978 · 49 citations · Full text

Computing, Computer Science, Algorithms +16