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

Projektleitung

Go to first page

Go to previous page

1 von 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

Publikationen

Go to first page

Go to previous page

1 von 12

Go to next page

Go to last page

2011	Messerschmidt, H., Otto, F., 2011. A hierarchy of monotone deterministic non-forgetting restarting automata. Theory of Computing Systems 343–373. https://doi.org/10.1007/s00224-009-9247-x
2011	Nagy, B., Otto, F., 2011. An automata-theoretical characterization of context-free trace languages, in: Cerna, I. (Hrsg.), SOFSEM 2011: Theory and Practice of Computer Science, Proc. Springer, Berlin, S. 406–417. https://doi.org/10.1007/978-3-642-18381-2_34
2011	Nagy, B., Otto, F., 2011. CD-Systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store.
2011	Nagy, B., Otto, F., 2011. Finite-state acceptors with translucent letters, in: Bel-Enguix, G. (Hrsg.), BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proc. SciTePress, Portugal.
2011	Nagy, B., Otto, F., 2011. Globally deterministic CD-systems of stateless R(1)-automata, in: Dediu, A.H. (Hrsg.), Language and Automata Theory and Applications, LATA 2011, Proc. Springer, Berlin, S. 390–401. https://doi.org/10.1007/978-3-642-21254-3_31
2011	Nagy, B., Otto, F., 2011. On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One. Universität Kassel, Kassel.
2011	Pardubska, D., Platek, M., Otto, F., 2011. On the correspondence between parallel communicating grammar systems and restarting automata, in: Bel-Enguix, G. and J.-L. (Hrsg.), Bio-Inspired Models for Natural and Formal Languages. Cambridge Scholar Publishing, Newcastle upon Tyne, S. 153–188.
2011	Pardubska, D., Platek, M., Otto, F., 2011. Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. Theoretical Computer Science 412, 458–477. https://doi.org/10.1016/j.tcs.2010.10.017
2011	Hundeshagen, N., Otto, F., Vollweiler, M., 2011. Transductions computed by PC-systems of monotone deterministic restarting automata, in: Domaratzki, M. and S. (Hrsg.), CIAA 201}: Implementation and Application of Automata, Proc. Springer, Berlin, S. 163–172. https://doi.org/10.1007/978-3-642-18098-9_18
2010	Otto, F., 2010. CD-systems of restarting automata governed by explicit enable and disable conditions, in: van Leeuwen, J. (Hrsg.), SOFSEM 2010: Theory and Practice of Computer Science, Proc. Springer, Berlin, S. 627–638.