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

10 of 12

Go to next page

Go to last page

2003	Otto, F., 2003. Restarting automata and their relations to the Chomsky hierarchy.
2003	Otto, F., 2003. Restarting automata and their relations to the Chomsky hierarchy, in: Esik, Z. and F. (Hrsg.), Developments in Language Theory, Proceedings DLT 2003. Springer, Berlin, S. 55–74.
2003	Platek, M., Otto, F., Mraz, F., 2003. Restarting automata and variants of j-monotonicity, in: Csuhaj-Varj?, E. (Hrsg.), Descriptional Complexity of Formal Systems, Proceedings DCFS 2003. MTA SZTAKI, Budapest, S. 303–312.
2003	Platek, M., Otto, F., Mraz, F., Jurdzinski, T., 2003. Restarting Automata and Variants of j-Monotonicity. Universität Kassel, Fachbereich Mathematik/Informatik, Kassel.
2003	Otto, F., Moriya, E., 2003. Shrinking alternating two-pushdown automata, in: Kyoto University (Hrsg.), New Aspects of Theoretical Computer Science. Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, S. 191–196.
2003	Niemann, G., Otto, F., 2003. The Church-Rosser languages and their relationship to other language classes, in: Martin-Vide, C. and M. (Hrsg.), Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back. Taylor and Francis, London.
2002	Cremanns, R., Otto, F., 2002. A completion procedure for finitely presented groups that is based on word cycles. Journal of Automated Reasoning 28, 235–256. https://doi.org/10.1023/A:1015741511536
2002	Pride, S., Otto, F., 2002. For rewriting systems the topological finiteness conditions FDT, FHT are not equivalent.
2002	Beaudry, M., Holzer, M., Niemann, G., Otto, F., 2002. On the relationship between the McNaughton families of languages and the Chomsky hierarchy, in: Kuich, W. (Hrsg.), Developments in Language Theory, Proceedings DLT 2001. Springer, Berlin, S. 340–348.
2002	Kobayashi, Y., Otto, F., 2002. Some exact sequences for the homotopy (bi-)module of a monoid. Int. Journal of Algebra and Computation 12, 247–284. https://doi.org/10.1142/S0218196702000985