Theory of computation from basics
Finite autometa and Regular language

Theory of computation from basics free download
Finite autometa and Regular language
Deterministic Finite Autometa DFA with Definition, Representation with examples, Acceptability of a string and languages, Non Deterministic Finite Autometa NFA with examples, Epsilon NFA with Example, Conversion from Epsilon NFA to NFA, Conversion from NFA to DFA, Equivalence of DFA and NFA , Minimization of Deterministic Finite Autometa, Moore Machine, Mealey Machine etc.