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

8 of 12

Go to next page

Go to last page

2004	Jurdzinski, T., Mraz, F., Otto, F., Platek, M., 2004. Cut hierarchies for restarting automata and Marcus t-contextual grammars. Fachbereich Mathematik/Informatik, Universität Kasssel, Kassel.Jurdzinski, T., Otto, F., Mraz, F., Platek, M., 2004. On the complexity of 2-monotone restarting automata, in: Calude, C.S. (Hrsg.), Developments in Language Theory, Proceedings DLT 2004. Springer, Berlin, S. 237–248.
2004	Jurdzinski, T., Mraz, F., Otto, F., Platek, M., 2004. Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.
2004	Jurdzinski, T., Mraz, F., Otto, F., Platek, M., 2004. Deterministic Two-Way Restarting Automata Don’t Need Auxiliary Symbols If They Are (Right-, Left-, Or Right-Left-) Monotone.
2004	Pride, S., Otto, F., 2004. For rewriting systems the topological finiteness conditions FDT and FHT are not equivalent. The Journal of the London Mathematical Society 69, 363–382. https://doi.org/10.1112/S0024610703004903
2004	Jurdzinski, T., Otto, F., Mraz, F., Platek, M., 2004. On left-monotone deterministic restarting automata, in: Calude, C.S. (Hrsg.), Developments in Language Theory, Proceedings DLT 2004. Springer, Berlin, S. 249–260.
2004	Moriya, E., Hofbauer, D., Huber, M., Otto, F., 2004. On State-Alternating Context-free Grammars. Fachbereich Mathematik/Informatik, Universitaet Kassel, Kassel.
2004
2004	Jurdzinski, T., Otto, F., Mraz, F., Platek, M., 2004. On the complexity of 2-monotone restarting automata. Fachbereich Mathematik/Informatik, Universitaet Kassel, Kassel.
2004	Mraz, F., Otto, F., Platek, M., 2004. Restarting automata and combinations of constraints, in: Vojtas, P. (Hrsg.), ITAT 2003, Information Technologies - Applications and Theory, Proceedings. Department of Computer Science, Faculty of Science, Pavol Jozef Safarik University, Kosice, S. 83–91.
2004	Otto, F., 2004. Restarting Automata - Notes for a Course at the 3rd International PhD School in Formal Languages and Applications. Fachbereich Mathematik/Informatik, Universitaet Kassel, Kassel.