- J. Hartmanis. Further
results on the structure of sequential machines. Journal of
the ACM, 10(1):78-88, January 1963.
References.
- J. Hartmanis. On memory
requirements for context-free language recognition. Journal of
the ACM, 14(4):663-665, October 1967.
References.
- J. Hartmanis. Computational complexity of
one-tape Turing machine computations. Journal of the
ACM, 15(2):325-339, April 1968.
References
and Citations.
- J. Hartmanis and H. Shank. On the recognition of primes by
automata. Journal of the ACM, 15(3):382-389, July 1968.
References.
- J. Hartmanis. On the
complexity of undecidable problems in automata theory. Journal
of the ACM, 16(1):160-167, January 1969.
References,
etc.
- J. Hartmanis and J. E. Hopcroft. An overview of the theory of
computational complexity. Journal of the ACM,
18(3):444-475, July 1971.
References,
Citations,
etc.
Shortcuts: