Lecture 21 : Introduction to Non Deterministic Finite Automata with example

Lecture 40 : Moore machine to Mealy machine conversion

Lecture 39 : Mealy machine to Moore machine conversion

Lecture 38 : Moore machine for binary number divisible by 3

Lecture 37 : Moore machine for 1s complement

Lecture 36 : Moore machine producing output as '1' whenever sequence 'bab' will be there in input

Lecture 35 : Moore machine producing output 'a' whenever sequence '10' there in the input string.

Lecture 34 : Introduction to Mealy machine with example

Lecture 33 : Introduction to Moore machine with example

Lecture 32 :Conversion of Epsilon NFA to NFA

Lecture 31 : Conversion of Epsilon NFA to NFA

Lecture 30 : Epsilon closure

Lecture 29 : what is epsilon nfa? | what is epsilon closure?