Jurdzinski, T., Otto, F., 2007. Shrinking restarting automata. International Journal of Foundations of Computer Science 18, 361–385. https://doi.org/10.1142/S0129054107004723

Messerschmidt, H., Mraz, F., Otto, F., Platek, M., 2006. Correctness preservation and complexity of simple RL-automata, in: Ibarra, O., Yen, H.-C. (Hrsg.), Implementation and Application of Automata, CIAA 2006 - Proceedings. Springer, Berlin, S. 162–172.

Jurdzinski, T., Mraz, F., Otto, F., Platek, M., 2006. Degrees of non-monotonicity for restarting automata. Theoretical Computer Science 1–34.

Mraz, F., Otto, F., Platek, M., 2006. Learning analysis by reduction from positive data, in: Sakakibara, Y. (Hrsg.), ICGI 2006, Proceedings. Springer, Berlin, S. 125–136.

Mraz, F., Otto, F., Platek, M., Jurdzinski, T., 2006. Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. Theoretical Computer Science 366, 272–296. https://doi.org/10.1016/j.tcs.2006.08.027

Messerschmidt, H., Otto, F., 2006. On nonforgetting restarting automata that are deterministic and/or monotone, in: Grigoriev, D. (Hrsg.), International Computer Science Symposium in Russia, Proc. CSR 2006. Springer, Berlin, S. 247–258.

Messerschmidt, H., Mraz, F., Otto, F., Platek, M., 2006. On the descriptional complexity of simple RL-automata. Fachbereich Mathematik/Informatik, Universitaet Kassel, Kassel.

Mraz, F., Otto, F., Platek, M., 2006. On the gap-complexity of simple RL-automata. Fachbereich Mathematik/Informatik, Universitaet Kassel, Kassel.

Mraz, F., Otto, F., Platek, M., 2006. On the gap-complexity of simple RL-automata, in: Oscar H., I., Zhe, D. (Hrsg.), Developments in Language Theory, DLT 2006, Proc. Springer, Berlin, S. 83–94. https://doi.org/10.1007/11779148_9

Otto, F., 2006. Restarting automata, in: Esik, Z. (Hrsg.), Recent Advances in Formal Languages and Applications. Springer, Berlin, S. 269–303.