Informatik - Research Information System | University of Kassel - CONVERIS Research Information System

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

Informatik

University of Kassel » Fachbereiche » Faculty of Electrical Engineering and Computer Science

Projects

03/2001 - 03/2002	Vergleichende Untersuchung derzeitiger Verfahren zur Messung der Intranet-Performance
03/2000 - 06/2001	Internetlast-Modellierung mit dynamischen Modellen
10/1995 - 10/1999	Multimedia in der Informatikdidaktik
1995 - 1996	Messung und Bewertung der Systemleistung von DV-Systemen und der Effizienz von SW

Publications

Go to first page

Go to previous page

2 of 3

Go to next page

Go to last page

2003	Kobayashi, Y., Otto, F., 2003. For finitely presented monoids the homological finiteness conditions FHT and bi-FP3 coincide. Journal of Algebra 264, 327–341. https://doi.org/10.1016/S0021-8693(03)00177-7
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	Stumme, G., Tane, J., Schmitz, C., 2003. The Courseware Watchdog: an Ontology-based tool for finding and organizing learning material, in: David Klaus, W.L. (Hrsg.), Mobiles Lernen und Forschen - Beiträge der Fachtagung an der Universität. Kassel University Press, S. 93–104.
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
2002	Hofbauer, D., Kögl, C., Madlener, K., Otto, F., 2002. XSSR: An experimental system for string rewriting - decision problems, algorithms, and implementation, in: Cohen, A.M. (Hrsg.), Proceedings of the 1st International Congress of Mathematical Software, ICMS-02. World Scientific, Beijing, China, S. 126–135.
2001	Otto, F., Ruskuc, N., 2001. Confluent monadic string-rewriting systems and automatic structures. Journal of Automata, Languages and Combinatorics 6, 375–388.
2001	Kobayashi, Y., Otto, F., 2001. On homotopical and homological finiteness conditions for finitely presented monoids. International Journal of Algebra and Computation 11, 391–403. https://doi.org/10.1142/S0218196701000577
2001	Jurdzinski, T., Lorys, K., Niemann, G., Otto, F., 2001. Some results on RRW- and RRWW-automata and their relationship to the class of growing context-sensitive languages. Fachbereich Mathematik/Informatik, Kassel.
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

Subordinate Organisational Units