Box 9
Contains 88 Results:
Two Memory Bounds for the Recognition of Primes by Automata, 1969
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
An Overview of the Theory of Computational Complexity, 1971
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Two Tests for the Linearity of Sequential Machines, 1965
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Homomorphic Images of Linear Sequential Machines, 1967
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
On Memory Requirements for Context-Free Language Recognition, 1967
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Tape-Reversal Bounded Turing Machine Computations, 1967
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
On the Complexity of Undecidable Problems in Automata Theory, 1969
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
What Makes Some Language Theory Problems Undecidable, 1970
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.