• Otto F and Wang Q. (2018). Weighted restarting automata. Soft Computing - A Fusion of Foundations, Methodologies and Applications. 22:4. (1067-1083). Online publication date: 1-Feb-2018.

    https://doi.org/10.1007/s00500-016-2164-4

  • Kwee K and Otto F. On Ordered RRWW-Automata. Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840. (268-279).

    https://doi.org/10.1007/978-3-662-53132-7_22

  • Messerschmidt H and Otto F. (2008). On determinism versus nondeterminism for restarting automata. Information and Computation. 206:9-10. (1204-1218). Online publication date: 1-Sep-2008.

    https://doi.org/10.1016/j.ic.2008.03.021

  • Stamer H and Otto F. Restarting Tree Automata. Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science. (510-521).

    https://doi.org/10.1007/978-3-540-69507-3_44

  • Jancar P, Mráz F, Plátek M and Vogel J. (2007). Monotonicity of restarting automata. Journal of Automata, Languages and Combinatorics. 12:3. (355-371). Online publication date: 1-Jan-2007.

    /doi/10.5555/1463079.1463081

  • Jurdziński T, Mráz F, Otto F and Plátek M. (2006). Degrees of non-monotonicity for restarting automata. Theoretical Computer Science. 369:1. (1-34). Online publication date: 15-Dec-2006.

    https://doi.org/10.1016/j.tcs.2006.08.029

  • Jurdzinski T and Otto F. (2006). Restarting automata with restricted utilization of auxiliary symbols. Theoretical Computer Science. 363:2. (162-181). Online publication date: 28-Oct-2006.

    https://doi.org/10.1016/j.tcs.2006.07.023

  • Jurdziński T, Otto F, Mráz F and Plátek M. On the complexity of 2-monotone restarting automata. Proceedings of the 8th international conference on Developments in Language Theory. (237-248).

    https://doi.org/10.1007/978-3-540-30550-7_20