search
Log In
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 

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

Please log in or register to answer this question.

Related questions

0 votes
0 answers
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.
asked Jan 28, 2019 in Theory of Computation AVICS 121 views
1 vote
2 answers
2
1.7k views
Consider following Regular Expression (i) a*b*b (a+ (ab)*)* b* (ii) a*(ab + ba)* b* What is length of shortest string which is in both (i) & (ii)? A. 2 B. 3 C. 4 D. None
asked Jun 16, 2015 in Theory of Computation gate chintu 1.7k views
3 votes
4 answers
3
2 votes
5 answers
4
1.3k views
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?
asked Apr 16, 2016 in Theory of Computation Neelay Upadhyaya 1.3k views
...