Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree

Résumé

Many relational structures are automatically presentable, i.e. elements of the domain can be seen as words over a finite alphabet and equality and other atomic relations are represented with finite automata. The first-order theories over such structures are known to be primitive recursive, which is shown by the inductive construction of an automaton representing any relation definable in the first-order logic. We propose a general method based on Ehrenfeucht-Fraïssé games to give upper bounds on the size of these automata and on the time required to build them. We apply this method for two different automatic structures which have elementary decision procedures, Presburger Arithmetic and automatic structures of bounded degree. For the latter no upper bound on the size of the automata was known. We conclude that the very general and simple automata-based algorithm works well to decide the first-order theories over these structures.
Fichier principal
Vignette du fichier
35.pdf (418.38 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00678190 , version 1 (03-02-2012)

Identifiants

  • HAL Id : hal-00678190 , version 1

Citer

Antoine Durand-Gasselin, Peter Habermehl. Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.242-253. ⟨hal-00678190⟩
118 Consultations
612 Téléchargements

Partager

Gmail Facebook X LinkedIn More