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

5 of 10

Go to next page

Go to last page

2006	Messerschmidt, H., Mraz, F., Otto, F., Platek, M., 2006. Correctness preservation and complexity of simple RL-automata, in: Ibarra, O., Yen, H.-C. (Hrsg.), Implementation and Application of Automata, CIAA 2006 - Proceedings. Springer, Berlin, S. 162–172.
2006	Jurdzinski, T., Mraz, F., Otto, F., Platek, M., 2006. Degrees of non-monotonicity for restarting automata. Theoretical Computer Science 369, 1–34. https://doi.org/10.1016/j.tcs.2006.08.029
2006	Mraz, F., Otto, F., Platek, M., 2006. Learning analysis by reduction from positive data, in: Sakakibara, Y. (Hrsg.), ICGI 2006, Proceedings. Springer, Berlin, S. 125–136.
2006	Mraz, F., Otto, F., Platek, M., Jurdzinski, T., 2006. Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. Theoretical Computer Science 366, 272–296. https://doi.org/10.1016/j.tcs.2006.08.027
2006	Messerschmidt, H., Otto, F., 2006. On nonforgetting restarting automata that are deterministic and/or monotone, in: Grigoriev, D. (Hrsg.), International Computer Science Symposium in Russia, Proc. CSR 2006. Springer, Berlin, S. 247–258.
2006	Messerschmidt, H., Mraz, F., Otto, F., Platek, M., 2006. On the descriptional complexity of simple RL-automata. Fachbereich Mathematik/Informatik, Universitaet Kassel, Kassel.
2006	Mraz, F., Otto, F., Platek, M., 2006. On the gap-complexity of simple RL-automata. Fachbereich Mathematik/Informatik, Universitaet Kassel, Kassel.
2006	Mraz, F., Otto, F., Platek, M., 2006. On the gap-complexity of simple RL-automata, in: Oscar H., I., Zhe, D. (Hrsg.), Developments in Language Theory, DLT 2006, Proc. Springer, Berlin, S. 83–94. https://doi.org/10.1007/11779148_9
2006	Jurdzinski, T., Otto, F., 2006. Restarting automata with restricted utilization of auxiliary symbols. Theoretical Computer Science 363, 162–181. https://doi.org/10.1016/j.tcs.2006.07.023
2006	Jurdzinski, T., Otto, F., 2006. Restricting the use of auxiliary symbols for restarting automata, in: Farre, J. (Hrsg.), Tenth International Conference on Implementation and Application of Automata, Proceedings CIAA 2005. Springer, Berlin, S. 176–187.

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