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

2 of 2

Go to next page

Go to last page

04/2001 - 12/2011	Alternierende Automaten und Grammatiken
01/1999 - 12/2009	Automatische Strukturen und Ersetzungssysteme
06/1996 - 05/2001	Implementierung eines "Experimental Systems for String-Rewriting" (XSSR)
04/1996 - 12/1999	Gutartige unendliche konvergente Wortersetzungssysteme: Ausdruckskraft und algorithmische Eigenschaften
01/1994 - 12/2005	Church-Rosser Sprachen und wachsend kontext-sensitive Sprachen
07/1991 - 12/2002	Konvergente Darstellungen algebraischer Strukturen
10/1989 - 06/1999	Unifikation in Gleichheitstheorien

Publications

Go to first page

Go to previous page

1 of 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.