Regular expression examples in theory of automata Part – 3

7745

5. Find a regular expression for the set of strings of one or more 0’s followed by a 1’s, over {0, 1}.

Solution:

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

∴∑ = {0, 1}

Here, the resultant regular expression will denote the set of stings of one or more 0’s followed by a 1.

The regular expression for one or more 0’s can be written as-

00* or formally written as 0+

Thus, the resultant regular expression can be written as-

00*1 or formally written as 0*1

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.