Design a DFA and NFA of the same string if the Here, q0 shows the initial state, q1 and q2 are the transitions states, and q3 and q4 are the final states.
Note – NFA and DFA both have the same power which means if NFA can recognize a language L then DFA can also be defined to do so and if DFA can recognize a language L then NFA can also be defined to do so.
Que-2: Draw deterministic and non-deterministic finite automata which accept a string containing “the” anywhere in a string of {a-z}, e.g., “there” but not “those”.
Learn more about automata at
https://brainly.com/question/16014011
#SPJ4
