1. von Braunmühl B., Verbeek R.: Finite change automata. Proc. 4th GI Conf. on Theoretical Computer Science (Lect. Notes in Comput. Sci., vol. 67, pp. 91–100) Berlin: Springer 1979
2. Chytil, M.P., Karlgren H.: Categorial grammars and list automata for strata of non-CF-languages. In: Buszkowski, W., Marciszewski, W., van Benthem, J. (eds.) Categorial grammars, John Benjamin, Amsterdam, Philadelphia 1988
3. Greibach, S.A.: The hardest context-free language. SIAM J. Comput. 2, 304–310 (1973)
4. Hibbard, T.N.: A generalization of context-free determinism. Inform and Control 11, 196–238 (1967)
5. Jančar, P.: Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata. Acta Math. et Inf. Univ. Ostraviensis, 1, Ostrava, 1993, pp. 67–73