Abstract
The characterization of the class of FO[∈+∈]-definable languages by some generating or recognizing device is still an open problem. We prove that, restricted to bounded languages, this class coincides with the class of semilinear languages. We also study some closure properties of FO[∈+∈]-definable languages which, as a by-product, allow us to give an alternative proof that the Dyck languages cannot be defined in FO[∈+∈]. © 2010 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Choffrut, C., Malcher, A., Mereghetti, C., & Palano, B. (2010). On the expressive power of FO[+]. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6031 LNCS, pp. 190–201). https://doi.org/10.1007/978-3-642-13089-2_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
