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

4 of 12

Go to next page

Go to last page

2007
2007
2007
2007	Moriya, E., Otto, F., 2007. On alternating non-context-free grammars. Universitaet Kassel, Fachbereich Elektrotechnik/Informatik, Kassel.Stamer, H., Otto, F., 2007. Restarting tree automata and linear context-free tree languages, in: Bozapalidis, S. and R. (Hrsg.), Algebraic Informatics, CAI 2007, Proceedings. Springer, Berlin, S. 275–289.
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.Jurdzinski, T., Otto, F., 2007. Shrinking restarting automata. International Journal of Foundations of Computer Science 18, 361–385. https://doi.org/10.1142/S0129054107004723
2007	Otto, F., 2007. Relative monoid presentations and finite derivation type, in: Andre, J.M. (Hrsg.), Semigroups and Formal Languages, Proc. of the International Conference in Honour of the 65th Birthday of Donald B. McAlister. World Scientific, Singapore, S. 240–254.
2007	Stamer, H., Otto, F., 2007. Restarting Tree Automata, in: van Leeuwen, J. (Hrsg.), SOFSEM 2007: Theory and Practise of Computer Science, Proc. Springer, Berlin, S. 510–521.
2007
2007
2007	Otto, F., 2007. Some decidability and undecidability results on Green’s relations for automatic monoids. Semigroup Forum 75, 521–536. https://doi.org/10.1007/s00233-007-0713-y