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

5 of 12

Go to next page

Go to last page

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.
2007	Otto, F., 2007. Two ways of introducing alternation into context-free grammars and pushdown automata. IEICE Transactions on Information and Systems E90D, 889–894. https://doi.org/10.1093/ietisy/e90-d.6.889
2006	Kambites, M., Otto, F., 2006. Church-Rosser groups and growing context-sensitive groups. Institut Mathematik/Informatik, Universität Kassel, Kassel.
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	Jurdzinski, T., Mraz, F., Otto, F., Platek, M., 2006. Degrees of non-monotonicity for restarting automata. Theoretical Computer Science 369, 1–34. https://doi.org/10.1016/j.tcs.2006.08.029
2006	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.
2006	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
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.
2006	Messerschmidt, H., Mraz, F., Otto, F., Platek, M., 2006. On the descriptional complexity of simple RL-automata. Fachbereich Mathematik/Informatik, Universitaet Kassel, Kassel.
2006	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