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

7 of 12

Go to next page

Go to last page

2005	Mraz, F., Otto, F., Platek, M., 2005. Learning analysis by reduction from positive data. Universtät Kassel, Fachbereich Mathematik/Informatik, Kassel.
2005	Jurdzinski, T., Mraz, F., Otto, F., Platek, M., 2005. Monotone deterministic RL-automata don’t need auxiliary symbols, in: De Felice, C. and R. (Hrsg.), Developments in Language Theory, Proceedings DLT 2005. Springer, Berlin, S. 284–295.
2005	Pride, S., Otto, F., 2005. On higher order homological finiteness of rewriting systems. Journal of Pure and Applied Algebra 200, 149–161. https://doi.org/10.1016/j.jpaa.2004.12.035
2005	Otto, F., Hofbauer, D., Huber, M., Moriya, E., 2005. On state-alternating context-free grammars. Theoretical Computer Science 337, 183–216. https://doi.org/10.1016/j.tcs.2004.12.029
2005	Jurdzinski, T., Otto, F., 2005. Restarting Automata with Restricted Utilization of Auxiliary Symbols.
2005	Jurdzinski, T., Otto, F., 2005. Sequential monotonicity for restarting automata, in: Vojtas, P. (Hrsg.), ITAT 2004, Information Technologies - Applications and Theory, Proceedings. Department of Computer Science, Faculty of Science, Pavol Jozef Safarik University, Kosice, S. 39–48.
2005	Holzer, M., Otto, F., 2005. Shrinking multi-pushdown automata. Fundamentals of Computation Theory, Proceedings FCT 2005, 305–316.
2005	Jurdzinski, T., Otto, F., 2005. Shrinking restarting automata, in: Jedrzejowicz, J., Szepietowski, A. (Hrsg.), Mathematical Foundations of Computer Science 2005: 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29--September 2, 2005. Proceedings. Springer, Berlin, Heidelberg, S. 532–543. https://doi.org/10.1007/11549345_46
2005	Jurdzinski, T., Otto, F., 2005. Shrinking Restarting Automata.
2005	Niemann, G., Otto, F., 2005. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Information and Computation 197, 1–21. https://doi.org/10.1016/j.ic.2004.09.003