The Gateway to Computer Science Excellence
+1 vote
42 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 by (399 points) | 42 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.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,461 answers
195,359 comments
100,248 users