Showing papers by "Juris Hartmanis published in 1967"
32 citations
TL;DR: This paper investigates homomorphisms on the state behavior of linear machines and characterize their homomorphic images and applies these results to characterize those nonlinear machines which can be realized by larger linear machines.
12 citations
TL;DR: The purpose of this note is to show that it is recursively undecidable how much tape is required by a Turing machine to recognize nonregular context-free languages.
Abstract: The purpose of this note is to show that it is recursively undecidable how much tape is required by a Turing machine to recognize nonregular context-free languages.
1 citations
18 Oct 1967
TL;DR: 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.
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
1 citations