Nondeterminism and the size of two way finite automata

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130716, Issue , 1978, Pages 275-286

  Sakoda, William J ^a   Sipser, Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84952949746     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800133.804357     Document Type: Conference Paper

References (9)

1. Cook, S. A., The complexity of theorem proving procedures, Third Annual ACM Symposium on Theory of Computing, May 1971, 151-158.
2. Karp, R. M., Reducibility among combinatorial problems, in, "Complexity of Computer Computations", R. E. Miller and J. W. Thatcher, eds., Plenum Press, N. Y. (1972), 85-104.
3. Savitch, W. J., Relationships between nondeterministic and deterministic tape complexities, J. Comput. Syst. Sci. 4 (1970), 177-192.
4. Cook, S. and R. Sethi, Storage Requirements for Deterministic polynomial time recognizeable languages, Sixth Annual ACM Symposium on Theory of Computing, May 1974, 33-39.
5. Jones, N. D. and W. T. Laaser, Complete problems for deterministic polynomial time, Sixth Annual ACM Symposium on Theory of Computing, May 1974, 40-46.
6. Even, S. and R. E. Tarjan, A combinatorial problem which is complete in polynomial space, Seventh Annual ACM Symposium on Theory of Computing, May 1975, 66-71.
7. Schaeffer, T. J., Complexity of decision problems based on finite two-person perfect-information games, Eighth Annual ACM Symposium on Theory of Computing, May 1976, 41-49.
8. Meyer, A. R. and M. J. Fischer, Economy of description by automata, grammers, and formal systems, Twelfth Annual Symposium an Switching and Automata Theory, October 1971, 188-191.
9. Seiferas, J., unpublished manuscript, (1973).