Q1:

Define DFA and NFA with suitable examples.

Q2:

Design a finite automata that accepts the string over {a, b} that contains even number of a. Your design should include the proper definition of finite state automata, transition table and transition diagram. Also, check for string w = baab. 

Q3:

Construct a DFA with ∑ = {0, 1} that contains a string ending in '0' with transition diagram, transition table and check any string.

Q4:

Construct a NFA with ∑ = {0, 1} that contains odd no. of 0s and even no. of 1s with transition diagram, transition table and check any string.