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

6 of 12

Go to next page

Go to last page

2006	Mraz, F., Otto, F., Platek, M., 2006. On the gap-complexity of simple RL-automata. Fachbereich Mathematik/Informatik, Universitaet Kassel, Kassel.
2006	Otto, F., 2006. Restarting automata, in: Esik, Z. (Hrsg.), Recent Advances in Formal Languages and Applications. Springer, Berlin, S. 269–303.
2006	Jurdzinski, T., Otto, F., 2006. Restarting automata with restricted utilization of auxiliary symbols. Theoretical Computer Science 363, 162–181. https://doi.org/10.1016/j.tcs.2006.07.023
2006	Jurdzinski, T., Otto, F., 2006. Restricting the use of auxiliary symbols for restarting automata, in: Farre, J. (Hrsg.), Tenth International Conference on Implementation and Application of Automata, Proceedings CIAA 2005. Springer, Berlin, S. 176–187.
2006	Kambites, M., Otto, F., 2006. Uniform decision problems for automatic semigroups. Journal of Algebra 303, 789–809. https://doi.org/10.1016/j.jalgebra.2005.11.028
2005	Jurdzinski, T., Otto, F., Mraz, F., Platek, M., 2005. Cut hierarchies for restarting automata and Marcus t-contextual grammars, in: Bozapalidis, S. (Hrsg.), Conference on Algebraic Informatics, Proceedings CAI 2005. Aristotle University, Thessaloniki, S. 157–171.
2005	Mraz, F., Otto, F., Platek, M., 2005. Degrees of Free Word-Order and Freely Rewriting Restarting Automata. Fachbereich Mathematik/Informatik, Universität Kassel, Kassel.
2005	Otto, F., Mraz, F., Platek, M., 2005. Degrees of monotonicity and Marcus t-contextual grammars, in: Esik, Z. and F. (Hrsg.), Automata and Formal Languages, Proceedings AFL 2005. Institute of Informatics, University of Szeged, Szeged, S. 249–262.
2005	Jurdzinski, T., Otto, F., Mraz, F., Platek, M., 2005. Deterministic two-way restarting automata and Marcus contextual grammars. Fundamenta Informaticae 64, 217–228.
2005	Mraz, F., Otto, F., 2005. Hierarchies of weakly monotone restarting automata. RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications 39, 325–342. https://doi.org/10.1051/ita:2005021