Regular expression examples in theory of automata Part – 3

7745

Next

6. Find the regular expression for the set of strings of two or more symbols followed by three or more 0’s, over {0, 1}.

Solution:

We have the input alphabets ∑ = {0, 1}

Here, the resultant regular expression will denotes the set of strings which must start with atleast any two symbols from the given ∑ and then must followed by atleast three 0’s.

The regular expression for two or more symbols over the given ∑

(0 + 1) (0 + 1) (0 + 1)*

The regular expression for three or more 0’s over the given ∑ can be written as-

0000*

Thus, we can write the resultant regular expression as-

(0 + 1) (0 + 1) (0 + 1) * 0000*

Next
Previous QuizRegular expression in theory of computation solved examples Part – 2
Next QuizRegular expression in theory of computation solved examples Part 4

LEAVE A REPLY

Please enter your comment!
Please enter your name here

This site uses Akismet to reduce spam. Learn how your comment data is processed.