The Community for Technology Leaders
8th Annual Symposium on Switching and Automata Theory (SWAT 1967) (1967)
Texas
Oct. 18, 1967 to Oct. 20, 1967
pp: 112-116
ABSTRACT
This paper describes some general results about hierarchies of undecidable problems in automata theory, and studies how properties of sets accepted by automata change from decidable to undecidable problems as the memory capacity of the automaton is increased.
INDEX TERMS
CITATION

J. Hartmanis, "On the complexity of undecidable problems in automata theory," 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)(FOCS), Texas, 1967, pp. 112-116.
doi:10.1109/FOCS.1967.23
98 ms
(Ver 3.3 (11022016))