Question: 1 . Regular Languages ( 1 5 points ) : Consider the following languages on = { a , b } , where nx (

1. Regular Languages (15 points): Consider the following languages on ={a, b},
where nx(w) denotes the number of xs in a string w.
a) L1={w : na(w) nb(w) mod 3=0}, find a DFA for L1.
Answer:
b) L2={w : na(w) nb(w) mod 3=1}, find a regular grammar for L2.
Answer:
c) Find a regular expression for the following
DFA.
Answer:

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!