1. Jančar, P., Mráz, F., Plátek, M.: Forgetting automata and the Chomsky hierarchy. In: Proc. SOFSEM 1992, pp. 41–44. Masaryk University, Brno, Institute of Computer Science (1992)
2. Lecture Notes in Computer Science;P. Jančar,1993
3. Jančar, P.: Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata. Acta Mathematica et Informatica Universitatis Ostraviensis 1, 67–74 (1993)
4. Mráz, F., Plátek, M.: A remark about forgetting automata. In: Proc. SOFSEM 1993, pp. 63–66. Masaryk University, Brno, Institute of Computer Science (1993)
5. Mráz, F., Plátek, M.: Erasing automata recognize more than context-free languages. Acta Mathematica et Informatica Universitatis Ostraviensis 3, 77–85 (1995)