An introduction to finite automata and their connection to logic
Formal Languages and Automata Theory
2012-02-16 v2 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1011.6491,
title = {An introduction to finite automata and their connection to logic},
author = {Howard Straubing and Pascal Weil},
journal= {arXiv preprint arXiv:1011.6491},
year = {2012}
}