Register

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

292 views
1 votes
1 votes

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 

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
M_Umair_Khan42900 asked Dec 29, 2022
787 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
User Avatar
6 votes
6 votes
0 answers
3
V pandey asked Oct 8, 2022
3,049 views
5. Consider a multi-dimensional array A [90][30]40] with base address start at 1000, calculate the address of A[10][20][3] in row major order and column major order. Assume the first element is stored at A [2][2][2] and each element take 2 byte.
Consider a multi-dimensional array A [90][30]40] with base address start at 1000, calculate the address of A[10][20][3] in row major order and column major order. Assume ...
User Avatar
0 votes
0 votes
0 answers
4
AVICS asked Jan 28, 2019
387 views
Consider a language L = {xaybzc| ((a ≤ b) or (a > b)) and (a ≠ c)}. Select the correct option.
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.
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 DCF...
User Avatar
Link Copied!