DocumentCode :
3263377
Title :
On the complexity of undecidable problems in automata theory
Author :
Hartmanis, J.
fYear :
1967
fDate :
18-20 Oct. 1967
Firstpage :
112
Lastpage :
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.
Keywords :
Automata;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Switching and Automata Theory, 1967. SWAT 1967. IEEE Conference Record of the Eighth Annual Symposium on
Conference_Location :
Austin, TX, USA
Type :
conf
DOI :
10.1109/FOCS.1967.23
Filename :
5397215
Link To Document :
بازگشت