First order formulas with modular predicates - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

First order formulas with modular predicates

Résumé

Two results by Schützenberger (1965) and by McNaughton and Papert (1971) lead to a precise description of the expressive power of first order logic on words interpreted as ordered colored structures. In this paper, we study the expressive power of existential formulas and of Boolean combinations of existential formulas in a logic enriched by modular numerical predicates. We first give a combinatorial description of the corresponding regular languages, and then give an algebraic characterization in terms of their syntactic morphisms. It follows that one can effectively decide whether a given regular language is captured by one these two fragments of first order logic. The proofs rely on nontrivial techniques of semigroup theory: stamps, derived categories and wreath products.
Fichier principal
Vignette du fichier
LICS2006.pdf (141.13 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00112846 , version 1 (09-11-2006)

Identifiants

Citer

Laura Chaubard, Jean-Eric Pin, Howard Straubing. First order formulas with modular predicates. 2006, pp.211-220, ⟨10.1109/LICS.2006.24⟩. ⟨hal-00112846⟩
122 Consultations
196 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More