Register

Recent questions tagged regular-expression

2 votes
1 answer
454
Regular Expression
Here is the DFA and I need to convert it to regular expression. I get two different answers when removing states in different order. i get b(c+ab)*d when I remove B first and then A while I get (bc*a)*bc*d when I eliminate A first. Which one is right?
Here is the DFA and I need to convert it to regular expression. I get two different answers when removing states in different order.i get b(c+ab)*d when I remove B first ...
User Avatar
1 votes
1 answer
455
Self Doubt In Regular Expression
Are r(*) and r* equivalent Regular Expression and What is the meaning of r(*)?
Are r(*) and r* equivalent Regular Expression and What is the meaning of r(*)?
User Avatar
1 votes
2 answers
456
Doubt
The number of unique strings in L((a+b)* a(b+ba)* ) of length less than four is _____
The number of unique strings in L((a+b)* a(b+ba)* ) of length less than four is _____
User Avatar
0 votes
1 answer
457
DFA to Regular Expression
Consider the given dfa What is the regular expression of the given dfa? I am getting :- a(ba)*bb + a(ba)*a + bb Is it correct or not?
Consider the given dfaWhat is the regular expression of the given dfa?I am getting :- a(ba)*bb + a(ba)*a + bbIs it correct or not?
User Avatar
1 votes
2 answers
458
theory of computation
contruct the PDA for CFG L={set of balanced paranthesis}
contruct the PDA for CFG L={set of balanced paranthesis}
User Avatar
1 votes
2 answers
459
theory of computtion
find regular expression of 1. S-> 01A/10B A->0B/1 B->1A/0 and 2. A->A00 /A1/0 3. S->baS/aA A->bbA/bb
find regular expression of1.S- 01A/10BA->0B/1B->1A/0and2.A->A00 /A1/0 3.S->baS/aAA->bbA/bb
User Avatar
0 votes
1 answer
460
Doubt
What is "Regular set" ?
What is "Regular set" ?
User Avatar
0 votes
2 answers
461
regular expression
write the regular expression for the given language L= { W | NO OF a mod 2= 1} (odd no of a's )
write the regular expression for the given language L= { W | NO OF a mod 2= 1} (odd no of a's )
User Avatar
2 votes
1 answer
464
Test by Bikram | Mock GATE | Test 4 | Question: 9
If $L$ is the set of all strings over $\{ x,y\}$ containing at least one $x$, then which of the following regular expressions does not generate $L$? $(x+y)^* x(y+y)^*$ $y^*x ( x+y)^*$ $( x+y)^* x$ $( x+y)^* xy^*$
If $L$ is the set of all strings over $\{ x,y\}$ containing at least one $x$, then which of the following regular expressions does not generate $L$?$(x+y)^* x(y+y)^*$$y^...
User Avatar
2 votes
1 answer
468
theory of computation
How many of them below are equivalent to (a+b)* ? A) (a*b)*a* B) (b*a)*b* C) a*(ba*)* D) b*(ab*)*
How many of them below are equivalent to (a+b)* ? A) (a*b)*a* B) (b*a)*b* C) a*(ba*)* D) b*(ab*)*
User Avatar
1 votes
1 answer
470
theory of computation
Is this correct ...?
Is this correct ...?
User Avatar
1 votes
0 answers
471
theory of computation
Construct minimal DFA for the language,L = ( L1 union L2 ) where L1 = L (aaa*b) and L2 = L (aab*aba*). The number of states in the minimal DFA, L is _____. Is this correct ??? or is there anyother minimal DFA witb lesser number of states ???
Construct minimal DFA for the language,L = ( L1 union L2 ) where L1 = L (aaa*b) and L2 = L (aab*aba*). The number of states in the minimal DFA, L is _____.Is this correct...
User Avatar
2 votes
2 answers
472
Peter Linz 5.1
I need two proves, i am stuckhere 1.Show that every S-grammar is Unambiguous 2.Show that a RegEx can never be Inherently Ambiguous so what to use here? Induction/Contradiction
I need two proves, i am stuckhere1.Show that every S-grammar is Unambiguous2.Show that a RegEx can never be Inherently Ambiguousso what to use here? Induction/Contradicti...
User Avatar
1 votes
3 answers
473
Theory of computation
Write a regular expression for the string having 3 consequetive 1s
Write a regular expression for the string having 3 consequetive 1s
User Avatar
2 votes
2 answers
474
theory of computation
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
User Avatar
1 votes
1 answer
475
theory of computation
L = { w : na(w) = nb(w) }. Is L*(kleene-closure of L) regular or not ?
L = { w : na(w) = nb(w) }. Is L*(kleene-closure of L) regular or not ?
User Avatar
0 votes
2 answers
476
theory of computation
Give regular expression for the complement of the language given below . L (r) = {a2nb2m+1: n ≥ 0, m ≥ 0} (or) r =(aa)* (bb)* b
Give regular expression for the complement of the language given below .L (r) = {a2nb2m+1: n ≥ 0, m ≥ 0} (or) r =(aa)* (bb)* b
User Avatar
0 votes
1 answer
477
theory of computation
Give a regular expression for LR, where L is the language given below, L = (a + b) b (a + ab)* My answer : ( a + ba )* b ( a + b ). Please verify ...
Give a regular expression for LR, where L is the language given below,L = (a + b) b (a + ab)*My answer : ( a + ba )* b ( a + b ).Please verify ...
User Avatar
0 votes
1 answer
478
theory of computation
Find dfa's for the following languages on Σ = {a,b}. L= {w: na(w) mod 3 >nb(w) mod 3}. L= {w :(na(w) – nb(w)) mod 3 > 0}.
Find dfa's for the following languages on Σ = {a,b}.L= {w: na(w) mod 3 >nb(w) mod 3}.L= {w :(na(w) – nb(w)) mod 3 0}.
User Avatar
3 votes
2 answers
479
theoryof computation
Both these languages are not equivalent...right ???
Both these languages are not equivalent...right ???
User Avatar
Page: