2011 | |
2010 | |
2010 | |
2009 | Kutrib, M., Messerschmidt, H., Otto, F., 2009. On stateless deterministic restarting automata, in: Nielsen, M. (Hrsg.), SOFSEM 2009: Theory and Practice of Computer Science, Proc. Springer, Berlin, S. 353–364. https://doi.org/10.1007/s00236-010-0125-4 |
2008 | Kutrib, M., Messerschmidt, H., Otto, F., 2008. On stateless two-pushdown automata and restarting automata, in: Csuhaj-Varjú, E. and É. (Hrsg.), Automata and Formal Languages, AFL 2008, Proceedings. Computer and Automation Research Institute, Hungarian Academy of Sciences, S. 257–268. |
2007 | |
2007 | Messerschmidt, H., Otto, F., 2007. On determinism versus nondeterminism for restarting automata, in: Loos, R. (Hrsg.), LATA 2007, Preproceedings. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, S. 413–424. |
2007 | Messerschmidt, H., Otto, F., 2007. Strictly deterministic CD-systems of restarting automata, in: Csuhaj-Varju, E. and E. (Hrsg.), Fundamentals of Computation Theory, FCT 2007, Proc. Springer, Berlin, S. 424–434. |
2006 | 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. |
2006 | 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. |