# Testbook Regular Language Consider a base language B={01,10}

1 vote
89 views

Consider a base language B={01,10}, now from B a new language is constructed in which every 0 can be replaced with 010 and every 10 can be replaced with 100. Which of the following regular expression represents the resulting language?

• (01)++(100)+

• 0(10)1+(10+)

• (01)++100

• Resulting language is not regular.

Explanation is appreciated

0
01001 can be generated only by 2nd which is part of the new language
0
second option seems correct.

## Related questions

1
121 views
consider a language L = {x^{a}y^{b}z^{c}| ((a ≤ b) or (a > b)) and (a ≠ c)}. Select the correct option. 1.L is CFL but not DCFL. 2.L is recursive but not CSL. 3. L is DCFL but not regular. 4.L is CSL but not CFL.
1 vote
The language (a+b)* is regular as there is a regular expression for it.But this language contains all possible strings. So it should imply that regular language is the super-set of all languages, but clearly it isn't! Subsets like $a^{n}b^{n}$ are not regular. Can someone tell me what am I missing?