Question: Show that the language A over Sigma = { a;b } is regular by constructing ( drawing ) a deterministic finite automaton M with

Show that the language A over \Sigma ={a;b} is regular by constructing (drawing) a deterministic finite automaton M with L(M)= A.
A ={w : the number of a's in w is divisible by 2 and the number of b's in w is divisible by 1}
Hint: Think about whether 0 is divisible by 2(divisible by 3).

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!