Showing papers by "Juris Hartmanis published in 1969"
TL;DR: This paper establishes two bounds for the rate of growth of memory in automata which recognize the set of primes.
Abstract: This paper establishes two bounds for the rate of growth of memory in automata which recognize the set of primes.
14 citations
TL;DR: 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 change from decidable to undECidable problems as the computational power of the automata is increased.
Abstract: 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.
6 citations
TL;DR: Automata theory goes further into the study of constructability by investigating a variety of abstract computing devices which perform these constructions, relating these devices to the algorithms they execute, and characterizing the simplicity of their operation.
5 citations
TL;DR: The purpose of this note is to show that there exist non-regular languages whose memory requirements for recognition by one-way and two-way automata differ by a double exponential and that this difference cannot be exceeded.
Abstract: The purpose of this note is to show that there exist non-regular languages whose memory requirements for recognition by one-way and two-way automata differ by a double exponential and that this difference cannot be exceeded.
2 citations