Additional Key Words and Phrases: determinstic context-free, acceptor, pushdown store machine, real-time computation, iterative array, palindrome, hierarchy, computing capability, context-free language, tabulator machine, file structure
Selected papers that cite this one
- Michael A. Harrison and Ivan M. Havel. Real-time strict deterministic languages. SIAM Journal on Computing, 1(4):333-349, December 1972.
Selected references
- Stephen N. Cole. Real-time computation by n-dimensional iterative arrays of finite-state machines. In Conference Record of 1966 Seventh Annual Symposium on Switching and Automata Theory, pages 53-77, Berkeley, California, 26-28 October 1966. IEEE.
- Patrick C. Fischer. Turing machines with restricted memory access. Information and Control, 9(4):364-379, August 1966.
- Seymour Ginsburg and Sheila A. Greibach. Deterministic context free languages. Information and Control, 9(6):620-648, December 1966.
- Sheila A. Greibach. A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM, 12(1):42-52, January 1965.
- R. E. Stearns. A regularity test for pushdown machines. Information and Control, 11(3):323-340, September 1967.