Selected papers that cite this one
- Anne Condon, Lisa Hellerstein, Samuel Pottle, and Avi Wigderson. On the power of finite automata with both nondeterministic and probabilistic states. SIAM Journal on Computing, 27(3):739-762, June 1998.
- J. Hartmanis and J. E. Hopcroft. An overview of the theory of computational complexity. Journal of the ACM, 18(3):444-475, July 1971.
- Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan, and Dawn Wilkins. How many queries are needed to learn? Journal of the ACM, 43(5):840-862, September 1996.
- Carl Pomerance, John Michael Robson, and Jeffrey Shallit. Automaticity II: Descriptional complexity in the unary case. Theoretical Computer Science, 180(1-2):181-201, 10 June 1997.
- Jeffrey Shallit and Yuri Breitbart. Automaticity I: Properties of a measure of descriptional complexity. Journal of Computer and System Sciences, 53(1):10-25, August 1996.
Selected references
- Arnold L. Rosenberg. On n-tape finite state acceptors. In Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, pages 76-81, Princeton, New Jersey, 11-13 November 1964. IEEE.
- R. E. Stearns, J. Hartmanis, and P. M. Lewis II. Hierarchies of memory limited computations. In Proceedings of the Sixth Annual Symposium on Switching Circuit Theory and Logical Design, pages 179-190. IEEE, 1965.