Uni.-Prof. Friedrich Otto - Research Information System | University of Kassel - CONVERIS Research Information System

Go to Header Go to Navigation Go to Content Go to Footer

Prof. Dr. Friedrich Otto

Projects as Principal Investigator

Go to first page

Go to previous page

1 of 2

Go to next page

Go to last page

01/2010 - 12/2013	Transductions Computed by Systems of Restarting Automata
01/2009 - 12/2010	Cooperating Distributed Systems
01/2009 - 12/2010	Cooperating Distributed Systems of Restarting Automata and Generalizations of CD Grammar Systems
01/2008 - 12/2011	Zustandslose Restart-Automaten
01/2007 - 12/2012	Eigentliche Sprachen von Restart Automaten
09/2006 - 12/2010	Restart-Automaten auf Baeumen
01/2006 - 12/2010	CD-Systeme von Restart Automaten
02/2005 - 01/2007	Automatic, Hyperbolic and Related Semigroups
09/2001 - 12/2004	Invariante Eigenschaften von Wortersetzungssystemen
07/2001 - 06/2007	Restart-Automaten: Varianten, Abschlusseigenschaften und Komplexität von Entscheidungsproblemen

Publications

Go to first page

Go to previous page

2 of 12

Go to next page

Go to last page

2010	Nagy, B., Otto, F., 2010. CD-systems of stateless deterministic R(1)-automata accept all rational trace languages, in: Dediu, A.H. (Hrsg.), Language and Automata Theory and Applications, LATA 2010, Proc. Springer, Berlin, S. 463–474. https://doi.org/10.1051/ita/2011123
2010	Nagy, B., Otto, F., 2010. CD-Systems of Stateless Deterministic R-Automata with Window Size One.
2010	Moriya, E., Otto, F., 2010. On alternating phrase-structure grammars. International Journal of Foundations of Computer Science 21, 1–25. https://doi.org/10.1142/S0129054110007106
2010	Otto, F., Platek, M., Mraz, F., 2010. On lexicalized well-behaved restarting automata that are monotone, in: Gao, Y. (Hrsg.), 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings. Springer, Berlin, S. 352–363. https://doi.org/10.1007/978-3-642-14455-4_32
2010	Otto, F., 2010. On proper languages and transformations of lexicalized types of automata, in: Ito, M., Kobayashi, Y., Shoji, K. (Hrsg.), Automata, Formal Languages and Algebraic Systems, Proc. of AFLAS 2008. World Scientific, Singapore, S. 201–222.
2010	Kutrib, M., Messerschmidt, H., Otto, F., 2010. On stateless deterministic restarting automata 391–412.
2010	Kutrib, M., Messerschmidt, H., Otto, F., 2010. On stateless two-pushdown automata and restarting automata 781–798.
2009	Otto, F., 2009. Left-to-right regular languages and two-way restarting automata. RAIRO: Theoretical Informatics and Applications 43, 653–665. https://doi.org/10.1051/ita/2009013
2009	Pardubska, D., Platek, M., Otto, F., 2009. On parallel communicating grammars systems and correctness preserving restarting automata, in: Dediu, A.H., Ionescu, A.M., Martin-Vide, C. (Hrsg.), Language and automata theory and applications. Springer, Berlin, S. 660–671. https://doi.org/10.1007/978-3-642-00982-2_56
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