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}.

  1. (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.

  2. (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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!