 |
|
|
|
| HAL : hal-00173125, version 4 |
| arXiv : 0709.2962 |
| Fiche détaillée |  Récupérer au format |
|
|
| International Journal of Algebra and Computation 20 (2010) 195-239 |
|
|
| Versions disponibles : | v1 (19-09-2007) | v2 (05-01-2009) | v3 (05-01-2009) | v4 (22-01-2009) |
|
|
|
|
| Algebraic characterization of logically defined tree languages |
|
|
| Zoltan Esik 1Pascal Weil 2 |
|
|
| (2010) |
|
|
|
| We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindström quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization relies on the usage of preclones, an algebraic structure introduced by the authors in a previous paper, and of the block product operation on preclones. Our results generalize analogous results on finite word languages, but it must be noted that, as they stand, they do not yield an algorithm to decide whether a given regular tree language is first-order definable. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Institute of Informatics |
|
|
|
University of Szeged |
|
|
| 2 : | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux – Université Victor Segalen - Bordeaux II |
|
|
|
|
|
|
|
|
|
| Méthodes Formelles |
|
|
|
|
| Domaine | : | Informatique/Logique en informatique Mathématiques/Logique |
|
|
| tree languages – algebraic theory of languages – first-order logic – Lindstrom quantifiers – preclones |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00173125, version 4 | |
| http://hal.archives-ouvertes.fr/hal-00173125 | |
| oai:hal.archives-ouvertes.fr:hal-00173125 | |
| Contributeur : Pascal Weil | |
| Soumis le : Jeudi 22 Janvier 2009, 06:36:22 | |
| Dernière modification le : Vendredi 18 Juin 2010, 14:48:37 | |
