论文信息 - On the Complexity of Undecidable Problems in Automata Theory

On the Complexity of Undecidable Problems in Automata Theory

Some general results about hierarchies of undecidable problems in automata theory are given, and studies are described which show how properties of sets accepted by automata (i.e. languages) change from decidable to undecidable problems as the computational power of the automata is increased. This work also yields unified techniques which characterize for different languages large classes of undecidable problems.

Juris Hartmanis

[1] Journal of the Association for Computing Machinery , 1961, Nature.

[2] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[3] Jeffrey D. Ullman,et al. Nonerasing Stack Automata , 1967, J. Comput. Syst. Sci..

[4] Richard Edwin Stearns,et al. Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[5] Richard Edwin Stearns,et al. Hierarchies of memory limited computations , 1965, SWCT.

[6] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .