Question: In this exercise the alphabet ={ a , b }. (3p) Define an NFA A (without -transitions) over such that L ( A )= M
In this exercise the alphabet ={a,b}.
-
(3p) Define an NFA A (without -transitions) over such that L(A)=MN, where M={w* | u,v*. w=ubaav} and N contains exactly those strings in * where every occurrence of a is directly followed by two or more occurrences of b.
-
(2p) Use the subset construction to build a corresponding DFA. You are allowed to omit inaccessible states.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
