 |
Laboratoire d'Informatique Algorithmique, Fondements et Applications |  |
|
Laboratoire d'Informatique Algorithmique, Fondements et Applications | |
| HAL: hal-00638611, version 1 |
| DOI: 10.1007/978-3-642-22993-0_24 |
| Detailed view |  Export this paper |
 |
| MFCS 2011, Varsovie : Pologne (2011) |
|
|
|
|
| On the Use of Guards for Logics with Data |
|
|
| Thomas Colcombet 1Gabriele Puppis 2 |
|
|
| (2011-04-22) |
|
|
|
| The notion of orbit finite data monoid was recently introduced by Bojańczyk as an algebraic object for defining recognizable languages of data words. Following Büchi's approach, we introduce the new logic 'rigidly guarded MSO' and show that the data languages definable in this logic are exactly those recognizable by orbit finite data monoids. We also establish, following this time the approach of Schützenberger, McNaughton and Papert, that the first-order variant of this logic defines exactly the languages recognizable by aperiodic orbit finite data monoids. Finally, we give a variant of the logic that captures the larger class of languages recognized by non-deterministic finite memory automata. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) |
|
|
|
CNRS : UMR7089 – Université Paris VII - Paris Diderot |
|
|
| 2: | Computing Laboratory (OUCL) |
|
|
|
University of Oxford |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Logic in Computer Science |
|
|
| Automata – algebra – monadic second-order logic – data languages |
|
| hal-00638611, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00638611 | |
| oai:hal.archives-ouvertes.fr:hal-00638611 | |
| From: Thomas Colcombet | |
| Submitted on: Sunday, 6 November 2011 16:33:36 | |
| Updated on: Sunday, 6 November 2011 16:33:36 | |
