CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Consider the following language

I.{wR xR wR yR |w, x, y (0,1)}
II.{x w xR |w, x (0,1)}
III.{w, xR w yR |w,x,y(0,1)}
IV.{w xR wR x|w, x, y(0,1)}

Which languages above are regular ?

Open in App
Solution

I,II,III regular
IV not regular
Try to avoid string matching by putting w as and make x and y go to (0+1). Therefore we're shown that the subset itself is and thus 1 is regular.

Similary For II we can put x as and then put w as (0+1).
Therefore II is also regular.

Now in III, put w as and make xR and yR goto (note that between x and y there's no string matching ). So III is also regular.

But IV is not regular let 's see why.
Try getting rid if string matching by putting w as .
So it we start all over again by putting x as , we are again wwR, another string matching. So we cannot got rid of string matching at all here, as even it both w and x are made the subset is , but this proves nothing only says that a subset of thus language is regular, but that doesn't say anything at all about the language itself.
So IV is not regular

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Understanding Divisibility
Watch in App
Join BYJU'S Learning Program
CrossIcon