Recent questions tagged regular-expression

1 1 vote
1 1 answer
4.6k
4.6k views
Consider the regular expression (a+b)(a+b) ..... (a+b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regula...
11 11 votes
1 answers 1 answer
8.4k
8.4k views
Let $L=\{w \in (0+1)^* \mid w \text{ has even number of 1's}\}$, i.e. $L$ is the set of all bit strings with even number of 1's. Which one of the regular expression below...
2 2 votes
1 answers 1 answer
931
931 views
The meaning of the regular expression (a+b)(a+b) isA)Strings of a's and b's where length is 2B)Strings of a's and b's of any length.C)Null stringD)None
2 2 votes
1 answers 1 answer
8.3k
8.3k views
Which of the following is/are not regularA)strings of 0's whose length is a perfect squareB)set of all palindromes made up of 0's & 1'sC)Strings of 0's whose length is pr...
1 1 vote
2 answers 2 answers
4.7k
4.7k views
Give a regular expression for L = {set of all strings in which number of a's are multiples of 3}∑={a,b,c}
2 2 votes
1 1 answer
1.6k
1.6k views
1) (L/a)a=L(the left side represents the concatenation of the languages L/a and {a})2) a(a/L)=L(again concatenation with {a},this time on the left,is intended)3) ...
4 4 votes
2 answers 2 answers
25.6k
25.6k views
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).
1 1 vote
2 2 answers
3.2k
3.2k views
If r1 and r2 are 2 Regular Expression Such thatr1 = (a+b)* r2 = (a*+b*+a*b*+b*a*)What are the different case's in which r1 = r2 ?Please Explain with an example
0 0 votes
3 answers 3 answers
3.5k
3.5k views
Problem 1 : what is the Language associated with this regular expression ? a*b* write it down.Problem 2: Does either a subset or Super-set of a regular language is alway...
1 1 vote
1 1 answer
1.2k
1.2k views
( a*+b*+a*b*+b*a* ) can we derive string abab and abba from this regular expression. what is the relationship between ( a*+b*+a*b*+b*a* ) and (a+b)*
2 2 votes
1 1 answer
4.0k
4.0k views
The context free grammar given by$S \rightarrow XYX$$X \rightarrow aX \mid bX \mid \lambda$$Y \rightarrow bbb$generates the language which is defined by regular expressio...
2 2 votes
1 1 answer
597
597 views
Recall that a typical URL has the following form. It starts with a protocol specifier, followed by a colon (:) and two forward slashes (/), followed by a hostname and a d...
2 2 votes
3 answers 3 answers
1.8k
1.8k views
What is the complement of given DFA accepting :?What is the Regular expression for this FA ?
1 1 vote
1 answers 1 answer
1.8k
1.8k views
L={w /na(w) + nb(w) =2 (mod 3)}Here na(w) is the no of a's in w
0 0 votes
2 answers 2 answers
10.0k
10.0k views
(a) All strings that do not end with aa.(b) All strings that contain an even number of b’s.(c) All strings which do not contain the substring ba.
12 12 votes
4 answers 4 answers
3.2k
3.2k views
Write a regular expression for all strings of $0$’s and $1$’s in which the total number of $0$’s to the right of each $1$ is even. Justify your answer.
1 1 vote
1 1 answer
7.2k
7.2k views
regular expression for " set of all strings over {a,b} in which there are at least two occurrences of b between any two occurrences of a ".
1 1 vote
1 answers 1 answer
2.8k
2.8k views
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
2 2 votes
1 answers 1 answer
12.2k
12.2k views
find regular expression over {a,b} corresponding to "set of strings containing at most 2a's."b*+ b*ab* + b*ab*ab*b*+ b*ab*none
0 0 votes
2 answers 2 answers
2.7k
2.7k views
Find regular expression for strings over {a,b}, "starting with any number of a's followed by one or more a's followed by a single b, followed by any number of a's followe...
0 0 votes
1 1 answer
553
553 views
is L={ a^2n | n>=1 } regular?ans is yesMy approach:As per pumping lemna,w=xyz i.e. let x=null y=a^n and z=a^n s.t. w=(null)(a^n)(a^n)we find out xz=(null)(a^n)=a...
0 0 votes
1 1 answer
1.5k
1.5k views
TOC
If a language L is not regular then homomorphism h(L) ?RegularNot regularNeed not regular.
2 2 votes
1 1 answer
1.5k
1.5k views
In c,octal number have regular expressionA.0(digit)*B.0(digit)+C.0(digit)D.0
2 2 votes
3 answers 3 answers
3.4k
3.4k views
Find a regular expression over Σ ={a,b,c} for all strings that contain no run of a's of length greater than 2. Here a run in a string is a sub string of length at least t...
1 1 vote
1 1 answer
1.2k
1.2k views
explain with proper procedure is diagram must for such type of questions
2 2 votes
2 answers 2 answers
1.4k
1.4k views
if yes then what is the difference b/w a*b* and a^n b^n ?if yes what is that ? if nothing then why a^n b^n is not a regular Language ?Forgive me if this is a stupid quest...