Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2013.329
URN: urn:nbn:de:0030-drops-39450
URL: https://drops.dagstuhl.de/opus/volltexte/2013/3945/
Dartois, Luc ; Paperman, Charles
Two-variable first order logic with modular predicates over words
| pdf-format: |
|
Abstract
We consider first order formulae over the signature consisting of the symbols of the alphabet, the symbol < (interpreted as a linear order) and the set MOD of modular numerical predicates. We study the expressive power of FO^2[<,MOD], the two-variable first order logic over this signature, interpreted over finite words. We give an algebraic characterization of the corresponding regular languages in terms of their syntactic morphisms and we also give simple unambiguous regular expressions for them. It follows that one can decide whether a given regular language is captured by FO^2[<,MOD]. Our proofs rely on a combination of arguments from semigroup theory (stamps), model theory (Ehrenfeucht-Fraïssé games) and combinatorics.
BibTeX - Entry
@InProceedings{dartois_et_al:LIPIcs:2013:3945,
author = {Luc Dartois and Charles Paperman},
title = {{Two-variable first order logic with modular predicates over words}},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
pages = {329--340},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-50-7},
ISSN = {1868-8969},
year = {2013},
volume = {20},
editor = {Natacha Portier and Thomas Wilke},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3945},
URN = {urn:nbn:de:0030-drops-39450},
doi = {10.4230/LIPIcs.STACS.2013.329},
annote = {Keywords: First order logic, automata theory, semigroup, modular predicates}
}
| Keywords: | First order logic, automata theory, semigroup, modular predicates | |
| Seminar: | 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) | |
| Issue date: | 2013 | |
| Date of publication: | 26.02.2013 |
