Theoretische Informatik - Forschungsinformationssystem | Universität Kassel - CONVERIS Forschungsinformationsystem

Go to Header Go to Navigation Go to Content Go to Footer

Theoretische Informatik

Universität Kassel » Fachbereiche » FB 16 - Elektrotechnik / Informatik » Informatik

Adresse:

Heinrich-Plett-Str. 40
34130 Kassel

Ehem. Personen

------

Publikationen

Go to first page

Go to previous page

9 von 10

Go to next page

Go to last page

2003	Beaudry, M., Holzer, M., Niemann, G., Otto, F., 2003. McNaughton families of languages. Theoretical Computer Science 290, 1581–1628. https://doi.org/10.1016/S0304-3975(02)00070-1
2003	Pride, S., Otto, F., 2003. On higher order homological finiteness of rewriting systems. Fachbereich Mathematik/Informatik, Universität Kassel, Kassel.
2003	Otto, F., Jurdzinski, T., 2003. On Left-monotone Restarting Automata. Fachbereich Mathematik/Informatik, Universität Kassel, Kassel.
2003	Moriya, E., Hofbauer, D., Huber, M., Otto, F., 2003. On State-Alternating Context-free Grammars - With Detailed Proofs and Supplementary Results -. Advanced Research Institute for Science, Waseda University and Engineering, Tokyo, Japan.
2003	Pride, S., Otto, F., 2003. Relative monoid presentations and finite derivation type. Fachbereich Mathematik/Informatik, Universität Kassel, Kassel.
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

Weitere Forschungsaktivitäten

09/2021

Professionalisierung angehender Biologie-Lehrkräfte zum Diagnostizieren von Schülerhür-den beim Experimentieren über den Einsatz intelligenter Lehr-Lernsysteme
Posterbeitrag