Closure under reversal of languages over infinite alphabets: a case study

Speaker:
Liat Peterfreund, M.Sc. Thesis Seminar
Date:
Wednesday, 17.6.2015, 14:30
Place:
Taub 601
Advisor:
Prof. M. Kaminski

The thesis deals with languages over infinite alphabets definable by weak pebble automata. We prove that these languages are not closed under reversal. For the proof, we establish a kind of periodicity of languages accepted by weak pebble automata.

Back to the index of events