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

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

Theoretische Informatik

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

Address:

Heinrich-Plett-Str. 40
34130 Kassel

Past Persons

------

Publications

Go to first page

Go to previous page

6 of 10

Go to next page

Go to last page

2006	Kambites, M., Silva, P., Steinberg, B.D., 2006. The spectra of lamplighter groups and Cayley machines. Geometriae Dedicata 120, 193–227. https://doi.org/10.1007/s10711-006-9086-8
2006	Kambites, M., Otto, F., 2006. Uniform decision problems for automatic semigroups. Journal of Algebra 303, 789–809. https://doi.org/10.1016/j.jalgebra.2005.11.028
2005	Jurdzinski, T., Otto, F., Mraz, F., Platek, M., 2005. Cut hierarchies for restarting automata and Marcus t-contextual grammars, in: Bozapalidis, S. (Hrsg.), Conference on Algebraic Informatics, Proceedings CAI 2005. Aristotle University, Thessaloniki, S. 157–171.
2005	Mraz, F., Otto, F., Platek, M., 2005. Degrees of Free Word-Order and Freely Rewriting Restarting Automata. Fachbereich Mathematik/Informatik, Universität Kassel, Kassel.
2005	Otto, F., Mraz, F., Platek, M., 2005. Degrees of monotonicity and Marcus t-contextual grammars, in: Esik, Z. and F. (Hrsg.), Automata and Formal Languages, Proceedings AFL 2005. Institute of Informatics, University of Szeged, Szeged, S. 249–262.
2005	Jurdzinski, T., Otto, F., Mraz, F., Platek, M., 2005. Deterministic two-way restarting automata and Marcus contextual grammars. Fundamenta Informaticae 64, 217–228.
2005	Gould, V., Kambites, M., 2005. Faithful functors from cancellative categories to cancellative monoids with an application to abundant semigroups. International Journal of Algebra and Computation 15, 683–698. https://doi.org/10.1142/S0218196705002451
2005	Mraz, F., Otto, F., 2005. Hierarchies of weakly monotone restarting automata. RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications 39, 325–342. https://doi.org/10.1051/ita:2005021
2005	Mraz, F., Otto, F., Platek, M., 2005. Learning analysis by reduction from positive data. Universtät Kassel, Fachbereich Mathematik/Informatik, Kassel.
2005	Jurdzinski, T., Mraz, F., Otto, F., Platek, M., 2005. Monotone deterministic RL-automata don’t need auxiliary symbols, in: De Felice, C. and R. (Hrsg.), Developments in Language Theory, Proceedings DLT 2005. Springer, Berlin, S. 284–295.

Other Research Activities

09/2021

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