Find regular expressions for the following defined languages. over the alphabet Σ = {0, 1}:
Computer Science
Find regular expressions for the following defined languages.
over the alphabet Σ = {0, 1}:
(i) Language of all strings having at least one 0 and
at least one 1.
(ii) Language of all strings that have at most two consecutive zeros.
(iii) Language of all strings whose fifth symbol, from left to right, is a 1.
to right, is a 1.
(iv) Language of all strings of length even ≥ 2 formed by alternating zeros and ones.
by alternating zeros and ones.
(v) Language of all strings whose length is ≥ 4.
(vi) Language of all strings of odd length that have ones only in the odd positions.
ones only in the odd positions.
(vii) Language of all strings whose length is a multiple of three.
three.
(viii) Language of all strings that do not contain three consecutive zeros.
(ix) Language of all strings that do not contain four consecutive zeros.
consecutive zeros.
!(x) Language of all strings that do not contain the substring
101.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
