Question

Design NFAs to recognize the following sets of strings

ab, bc, and ca. Assume the alphabet is {a,b,c}

Answer 1

Solution:

=>Set of strings = {ab, bc, ca}

=>Alphabet() = {a, b, c}

Explanation:

Designing NFA:

=>In the given NFA there are 7 states.

=>State A is the initial state, states C, E and G are final states, states B, D and F are intermediate states.

=>At the final states only string are accepted by finite automata otherwise rejected.

=>We can see that strings ac, bc and ca are accepted by the given NFA.

I have explained each and every part with the help of statements as well as image attached to the answer above.