Algebraic Automata Theory
Course Description
Algebraic Automata Theory, or more correctly Semi Group Theory is the study of the algebraic structure Semi Group which is a set with an associative operator on it. Semi Groups are of interest to Automata Theorists because the set of words forms an Semi Group under concatenation and different representation of Semi Groups correspond to automata theoretic descriptions of languages, like finite Semi Groups describe regular languages. And its pretty based on its own too :3
Notes
- Semi-Groups
- Monoids
- Myhill Nerode Theorem
- Monoids as Languages
- Quotients of Syntactic Monoid of a language
- Language Operations on Monoids
- Construction of Syntactic Monoid of an Automata
- Logic, Regular Languages and Languages Recognized by Monoids
- Ramsay’s Theorem
- Green’s Relations
- Location Lemma
- Green’s Theorem
- Factorization Forest Theorem