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

3 of 12

Go to next page

Go to last page

2009	Pardubska, D., Platek, M., Otto, F., 2009. Parallel communicating grammars systems with regular control, in: Bozapalidis, S. and R. (Hrsg.), Algebraic Informatics, CAI 2009, Proc. Springer, Berlin, S. 342–360. https://doi.org/10.1007/978-3-642-03564-7_23
2009	Otto, F., Stamer, H., 2009. Single-path restarting tree automata, in: Bozapalidis, S. and R. (Hrsg.), Algebraic Informatics, CAI 2009, Proc. Springer, Berlin, S. 324–341.
2009	Mraz, F., Otto, F., Platek, M., 2009. The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages. Teoretical Computer Science 410, 3530–3538. https://doi.org/10.1016/j.tcs.2009.03.017
2009	Platek, M., Otto, F., Mraz, F., 2009. Two-dimensional hierarchies of proper languages of lexicalized FRR-automata. Information and Computation 207, 1300–1314. https://doi.org/10.1016/j.ic.2009.02.011
2008	Otto, F., Platek, M., 2008. A two-dimensional taxonomy of proper languages of lexicalized FRR-automata, in: Martin-Vide, C. (Hrsg.), LATA 2008, Proceedings. Springer, Berlin, S. 409–420.
2008	Otto, F., 2008. Lower bounds for nonforgetting restarting automata and CD-systems of restarting automata. Universität Kassel, Kassel.
2008	Otto, F., Moriya, E., 2008. On alternating phrase-structure grammars, in: Martin-Vide, C. (Hrsg.), LATA 2008, Proceedings. Springer, Berlin, S. 397–408.
2008	Pardubska, D., Platek, M., Otto, F., 2008. On PCGS and FRR-automata, in: Vojtas, P. (Hrsg.), ITAT 2008, Proc. Department of Computer Science, Faculty of Science, Pavol Jozef Safarik University, Kosice, S. 41–47.
2008	Kutrib, M., Messerschmidt, H., Otto, F., 2008. On stateless two-pushdown automata and restarting automata, in: Csuhaj-Varjú, E. and É. (Hrsg.), Automata and Formal Languages, AFL 2008, Proceedings. Computer and Automation Research Institute, Hungarian Academy of Sciences, S. 257–268.
2008	Otto, F., Mraz, F., Jurdzinski, T., Platek, M., 2008. On the complexity of 2-monotone restarting automata. Theory of Computing Systems 42, 488–518. https://doi.org/10.1007/s00224-007-9004-y