Lecture no. 4
Lecture no. 4. FINITE AUTOMATA. Review Languages Operations on languages Automata FA-Finite Automata DFA. Languages. ∑* is the se t of all strings on ∑. Denoted by. E.g : ∑={ a,b,c } ∑*={ λ , a, b, c, aa , ab , ac, ba , …} ∑ + is the set of all strings except ?
256 views • 17 slides