Name
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. |
Year | Venue | Keywords |
|---|---|---|
2010 | Modern Applications of Automata Theory | formal language,automata theory,finite automata,first order |
DocType | Volume | ISSN |
Journal | abs/1011.6 | Modern Applications of Automata Theory (2012) 3-43 |
Citations | PageRank | References |
4 | 0.44 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Howard Straubing | 1 | 528 | 60.92 |
| Pascal Weil | 2 | 4 | 0.44 |