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

12 of 12

Go to next page

Go to last page

2000	Madlener, K., Otto, F., 2000. Some applications of prefix-rewriting in monoids, groups, and rings, in: M. Atkinson, N.G. (Hrsg.), Geometric Aspects of Modern Algebra. Cambridge University Press, Cambridge, S. 150–191.
2000	Otto, F., Sattler-Klein, A., 2000. The property FDT is undecidable for finitely presented monoids that have polynomial-time decidable word problems. International Journal of Algebra and Computation 10, 285–307. https://doi.org/10.1142/S0218196700000108
2000	Katsura, M., Kobayashi, Y., Otto, F., 2000. Undecidability results for monoids with linear-time decidable word problem, in: D.T. Lee, S.T. (Hrsg.), Algorithms and Computation, Proceedings ISAAC’2000. Springer, Berlin, S. 278–289.
1999	Otto, F., 1999. On s-regular prefix-rewriting systems and automatic structures, in: T. Asano, H.I. (Hrsg.), Computing and Combinatorics, Proceedings of COCOON’99. Springer, Berlin, S. 422–431.
1998	Katsura, M., Kobayashi, Y., Otto, F., 1998. Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids. Journal of Symbolic Computation 26, 621–648. https://doi.org/10.1006/jsco.1998.0230
1998	Niemann, G., Otto, F., 1998. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages, in: Nivat, M. (Hrsg.), Foundations of Software Science. Springer, Berlin, S. 243–257.
1997	Otto, F., 1997. PDT is undecidable for finitely presented monoids with solvable word problems, in: Chlebus, E., Czaja, L. (Hrsg.), FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS;INFORMATION AND COMPUTATION. Springer, Berlin, S. 388–399.
1996	Cremanns, R., Otto, F., 1996. For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP3 22, 155–177. https://doi.org/10.1006/jsco.1996.0046