Solved problems on DFA and NFA

Obtain a DFA to accept strings of a’s and b’s starting with the string ab
Draw a DFA to accept string of 0’s and 1’s ending with the string 011
Draw a DFA to accept string of 0’s and 1’s ending with the string 011
Design a DFA to accept string of 0’s & 1’s when interpreted as binary numbers would be multiple of 3.
Draw a DFA to accept string of 0’s and 1’s ending with the string 011
Find closure of each state and give the set of all strings of length 3 or less accepted by automaton
Obtain a DFA to accept strings of a’s and b’s having a sub string aa
Find closure of each state and give the set of all strings of length 3 or less accepted by automaton
Obtain an NFA to accept the following language L = {w | w ababn or aban where n t 0}
Obtain an NFA to accept the following language L = {w | w ababn or aban where n t 0}
Obtain an NFA which accepts strings of a’s and b’s starting with the string ab
Obtain an NFA which accepts strings of a’s and b’s starting with the string ab
Obtain a DFA to accept strings of a’s and b’s having even number of a’s and b’s.
Obtain a DFA to accept strings of a’s and b’s having even number of a’s and b’s.

Leave a Reply