- Chomsky , N. and Schutzenberger , M. P. 1963 . “ The algebraic theory of context-free languages. ” . In Computer Programming and Formal Systems , Edited by: Braffort , P. and Hirschberg , D. 118 – 161 . Amsterdam : North-Holland .
- Ginsburg , S. and Spanier , E. H. 1966 . Finite-turn pushdown automata . Inform. Contr. , 4 : 429 – 453 .
- Holzer , M. and Lange , K. On the complexities of linear LL(1} and LR(1} grammars . PTOC. 9th International Conference on Fundamentals of Computation Theory . Vol. 710 , pp. 299 – 308 . Lecture Notes in Comput. Sci.
- Hopcroft , J. E. and Ullman , J. D. 1979 . Introduction to Automata Theory, Languages, and Computation , Reading, Mass : Addison-Wesley .
- Ohki , Y. and Moriya , E. 1998 . Some subclasses of LOGCFL . Technical Report of IEICE COMP97-116, March , 1998 : 79 – 84 . (in Japanese}
- Moriya , E. and Ohki , Y. 1999 . A generalization of finite-turn pushdown automaton languages and LOGCFL, Gakujutsu Kenkyuu (Academic Study} , Math. Series Vol. 47 , 17 – 28 . School of Education, Waseda Univ. .
- Moriya , E. 1999 . Turn bounded pushdown automata revisited . Congressus Numerantium , 138 : 65 – 77 .
- Moriya , E. and Tada , T. December 2001 . On the space complexity of turn bounded pushdown automata , Tech. Kept. 2001-18, Adv. Res. Inst for Sci. & Engg. December , Waseda University .
- Sudborough , I. H. 1975 . A. note on tape-bounded complexity classes and linear context-free languages . J. Assoc. Comput. Mach. , 22 : 499 – 500 .
- Sudborough , I. H. 1978 . On the tape complexity of deterministic context-free languages . J. Assoc. Comput. Mach. , 25 : 405 – 414 .
International Journal of Computer Mathematics
Volume 80, 2003 - Issue 3