| 1 | Introduction To Automata Theory And Formal Languages | arrow_forward |
| 2 | Equivalence Of Nfa And Dfa | arrow_forward |
| 3 | Operations On Languages | arrow_forward |
| 4 | Regular Expressions And Languages | arrow_forward |
| 5 | Closure Properties Of Regular Languages | arrow_forward |
| 6 | Decision Algorithms | arrow_forward |
| 7 | Properties Of Regular Sets (Languages) | arrow_forward |
| 8 | Exampleof Non Deterministic Finite Automata | arrow_forward |
| 9 | Two-way Finite Automata | arrow_forward |
| 10 | Myhill-nerode Theorem | arrow_forward |