1. Membership for growing context-sensitive grammars is polynomial
2. P. Jančar, F. Mráz, M. Plátek and J. Vogel, Restarting automata, inProc. FCT'95, edited by H. Reichel. Springer, Berlin,Lect. Notes Comput. Sci.965(1995) 283–292.
3. T. Jurdziński, K. Loryś, G. Niemann and F. Otto, Some results on RWW- and RRWW-automata and their relationship to the class of growing context-sensitive languages. Tech. Report 14/01, Fachbereich Mathematik/Informatik, Universität Kassel (2001). Also: To appear in revised form in theJ. Autom. Lang. Comb.
4. Church-Rosser Thue systems and formal languages