 |
|
|
|
| HAL : hal-00541028, version 2 |
| arXiv : 1011.6491 |
| Fiche détaillée |  Récupérer au format |
|
|
| Modern applications of automata theory, Deepak D'Souza, Priti Shankar (Ed.) (2012) 3-43 |
|
|
| Versions disponibles : | v1 (30-11-2010) | v2 (21-09-2011) |
|
|
|
|
| An introduction to finite automata and their connection to logic |
|
|
| Howard Straubing 1Pascal Weil 2 |
|
|
| (2012) |
|
|
|
| This is a tutorial on finite automata. We present the standard material on determinization and minimization, as well as an account of the equivalence of finite automata and monadic second-order logic. We conclude with an introduction to the syntactic monoid, and as an application give a proof of the equivalence of first-order definability and aperiodicity. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Boston College (BOSTON COLLEGE) |
|
|
|
Computer Science Department, Boston College |
|
|
| 2 : | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Théorie et langage formel Informatique/Logique en informatique |
|
|
|
|
| hal-00541028, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00541028 | |
| oai:hal.archives-ouvertes.fr:hal-00541028 | |
| Contributeur : Pascal Weil | |
| Soumis le : Mercredi 21 Septembre 2011, 12:34:51 | |
| Dernière modification le : Mercredi 15 Février 2012, 08:57:34 | |
