@inproceedings{6c6eb76c14e24ef49ca505526ba9d079,
title = "On expressive power of regular expressions over infinite orders",
abstract = "Two fundamental results of classical automata theory are the Kleene theorem and the B{\"u}chi-Elgot-Trakhtenbrot theorem. Kleene{\textquoteright}s theorem states that a language of finite words is definable by a regular expression iff it is accepted by a finite state automaton. B{\"u}chi-Elgot- Trakhtenbrot{\textquoteright}s theorem states that a language of finite words is accepted by a finite-state automaton iff it is definable in the weak monadic secondorder logic. Hence, the weak monadic logic and regular expressions are expressively equivalent over finite words. We generalize this to words over arbitrary linear orders.",
author = "Alexander Rabinovich",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 11th International Computer Science Symposium in Russia, CSR 2016 ; Conference date: 09-06-2016 Through 13-06-2016",
year = "2016",
doi = "10.1007/978-3-319-34171-2\_27",
language = "الإنجليزيّة",
isbn = "9783319341705",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "382--393",
editor = "Woeginger, \{Gerhard J.\} and Kulikov, \{Alexander S.\}",
booktitle = "Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, Proceedings",
address = "ألمانيا",
}