@inproceedings{6980815b382a4ffc9ef18f7bc9971b8f,
title = "Closure under reversal of languages over infinite alphabets",
abstract = "It is shown that languages definable by weak pebble automata are not closed under reversal. For the proof, we establish a kind of periodicity of an automaton{\textquoteright}s computation over a specific set of words. The periodicity is partly due to the finiteness of the automaton description and partly due to the word{\textquoteright}s structure. Using such a periodicity we can find a word such that during the automaton{\textquoteright}s run on it there are two different, yet indistinguishable, configurations. This enables us to remove a part of that word without affecting acceptance. Choosing an appropriate language leads us to the desired result.",
keywords = "Closure properties, Infinite alphabets, Reversal, Weak pebble automata",
author = "Daniel Genkin and Michael Kaminski and Liat Peterfreund",
note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 13th International Computer Science Symposium in Russia, CSR 2018 ; Conference date: 06-06-2018 Through 10-06-2018",
year = "2018",
doi = "10.1007/978-3-319-90530-3\_13",
language = "الإنجليزيّة",
isbn = "9783319905297",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "145--156",
editor = "Podolskii, \{Vladimir V.\} and Fomin, \{Fedor V.\}",
booktitle = "Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Proceedings",
address = "ألمانيا",
}