Question: Question 1 Give a regular expression over the alphabet ={a,b} for the set of words in which the substring ' ab ' does not occur:

 Question 1 Give a regular expression over the alphabet ={a,b} for

Question 1 Give a regular expression over the alphabet ={a,b} for the set of words in which the substring ' ab ' does not occur: For example, "baa" will be accepted but "aab" will not. [2 marks] Question 2 Consider the regular expression (ab)a. In a step-by-step fashion, using the rules from Handout 2b, convert each sub-expression of the regular expression into an NFA and, by doing so, obtain a DFA that is equivalent to the overall regular expression. [5 marks]

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!