An introduction to finite automata and their connection to logic

Abstract : 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.
Type de document :
Chapitre d'ouvrage
Deepak D'Souza, Priti Shankar. Modern applications of automata theory, World Scientific, pp.3-43, 2012, IISc Research Monographs
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00541028
Contributeur : Pascal Weil <>
Soumis le : mercredi 21 septembre 2011 - 12:34:51
Dernière modification le : jeudi 11 janvier 2018 - 06:20:16
Document(s) archivé(s) le : jeudi 30 mars 2017 - 15:28:43

Fichiers

chap1.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00541028, version 2
  • ARXIV : 1011.6491

Collections

Citation

Howard Straubing, Pascal Weil. An introduction to finite automata and their connection to logic. Deepak D'Souza, Priti Shankar. Modern applications of automata theory, World Scientific, pp.3-43, 2012, IISc Research Monographs. 〈hal-00541028v2〉

Partager

Métriques

Consultations de la notice

330

Téléchargements de fichiers

199