Question: 1 . Let the alphabet Sigma = { a , b } . Given the regular expression r = ( a + b )

1. Let the alphabet \Sigma ={a, b}. Given the regular expression r =(a + b)*bb, assume a language L(r) is the language defined by the regular expression r. Explain in English what accepted strings in the language are like.
2. Design and draw the state transition diagram of a finite automaton (FA) for the regular language above, in question 1

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 Programming Questions!