Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-11-30
Modern Applications of Automata Theory (2012) 3-43
Computer Science
Formal Languages and Automata Theory
Scientific paper
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.
Straubing Howard
Weil Pascal
No associations
LandOfFree
An introduction to finite automata and their connection to logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An introduction to finite automata and their connection to logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An introduction to finite automata and their connection to logic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-444921