Regular expression examples in theory of automata Part – 3

7689

Back

1. Find out the regular expression for the set of strings of a’s, b’s and c’s (aaa, aab, .. .. .. .., ccc).

Solution:

We have the input alphabets ∑ = {a, b, c}

Here, the resultant regular expression will denote any string from the given set (aaa, aab, .. .. .. .. , ccc). Thus, the resultant regular expression can be simply written as-

[a | b | c] [a | b | c] [a | b | c]

or,

[a + b + c] [a + b + c] [a + b + c]

or

[a ∪ b ∪| c] [a ∪ b ∪ c] [a ∪ b ∪ c]

 

Back
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.