[1] von Braunmühl B., Verbeek R.: Finite change automata. Proceedings of the Fourth GI Conference on Theoretical Computer Science, Lecture Notes in Computer Science, Springer-Verlag 67 (1979), 91-100. MR 0568095

[2] Hopcroft J. E., Ullman J. D.: Formal languages and their relation to automata. Addison-Wesley, Reading, Massachusetts, 1969. MR 0237243 | Zbl 0196.01701

[3] Immerman N.: Nondeterministic space is closed under complement. Proceedings of the 3rd Annual Conference Structure in Complexity Theory (June 1988), 14-17. MR 0961049

[4] Jančar P.: Nondeterministic forgetting automata are less powerfull than deterministic linear bounded automata. Acta Mathematica et Informatica Universitatis Ostraviensis 1 (1993), 67-74. MR 1250928

[5] Jančar P., Mráz F., Plátek M.: Characterization of context-free languages by erasing automata. in Proceedings of MFCS'92, Lecture Notes in Computer Science, Springer-Verlag 629 (August 1992), 307-314. MR 1255145

[6] Jančar P., Mráz F., Plátek M.: Forgetting automata and the Chomsky hierarchy. SOFSEM '92, 1992.

[7] Jančar P., Mráz F., Plátek M.: A taxonomy of forgetting automata. in Proceedings of MFCS '93, Lecture Notes in Computer Science, Springer-Verlag 711 (August 1993), 527-536. MR 1265088

[8] Mráz F., Plátek M.: Erasing automata recognize more than context-free languages. in SOFSEM '91, Jasná pod Chopkom, Nízké Tatry 1991.

[9] Mráz F., Plátek M.: A remark about forgetting automata. in SOFSEM'93, Hrdoňov, 63-66, 1993.

[10] Plátek M., Vogel J.: Deterministic list automata and erasing graphs. The Prague Bulletin of Mathematical Linguistics, Prague 45 (1986), 27-50. MR 0845522

[11] Rytter W.: On the recognition of context-free languages. in proceedings of Fifth Symposium on Computation Theory, Lecture Notes in computer Science, Springer-Verlag 208 (1985), 318-325. MR 0827542 | Zbl 0605.68077

[12] Szelepcsényi R.: The method of forced enumeration for nondeterministic automata. Acta Informatica 26 (3) (November 1988), 279-284. DOI 10.1007/BF00299636 | MR 0975334