Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged regular-expression
3
votes
1
answer
541
UGC NET CSE | June 2012 | Part 3 | Question: 43
The regular expression for the following DFA ab*(b+aa*b)* a*b(b+aa*b)* a*b(b*+aa*b) a*b(b+aa*b)*
The regular expression for the following DFAab*(b+aa*b)*a*b(b+aa*b)*a*b(b*+aa*b)a*b(b+aa*b)*
go_editor
4.3k
views
go_editor
asked
Jul 7, 2016
Theory of Computation
ugcnetcse-june2012-paper3
theory-of-computation
regular-expression
+
–
1
votes
1
answer
542
UGC NET CSE | June 2012 | Part 3 | Question: 35
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 regular expression contains n states n+1 states n+2 states 2$^n$ states
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...
go_editor
4.0k
views
go_editor
asked
Jul 7, 2016
Theory of Computation
ugcnetcse-june2012-paper3
theory-of-computation
regular-expression
+
–
10
votes
1
answer
543
ISRO2016-33
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 represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1^*)^*0^*$ $0^*1(10^*1)^*10^*$
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...
Desert_Warrior
5.0k
views
Desert_Warrior
asked
Jul 3, 2016
Theory of Computation
theory-of-computation
regular-expression
isro2016
+
–
2
votes
1
answer
544
The meaning of the regular expression
The meaning of the regular expression (a+b)(a+b) is A)Strings of a's and b's where length is 2 B)Strings of a's and b's of any length. C)Null string D)None
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
vivekpinto07
561
views
vivekpinto07
asked
Jun 25, 2016
Theory of Computation
theory-of-computation
regular-expression
+
–
2
votes
1
answer
545
Regularity of the strings
Which of the following is/are not regular A)strings of 0's whose length is a perfect square B)set of all palindromes made up of 0's & 1's C)Strings of 0's whose length is prime number D)all the above
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...
vivekpinto07
7.7k
views
vivekpinto07
asked
Jun 24, 2016
Theory of Computation
regular-expression
regular-language
theory-of-computation
+
–
6
votes
4
answers
546
set of strings with atmost one pair of consecutive 0's and at most one pair of consecutive 1's
Sankaranarayanan P.N
27.2k
views
Sankaranarayanan P.N
asked
Jun 24, 2016
Theory of Computation
theory-of-computation
regular-expression
+
–
4
votes
1
answer
547
The set of all strings in which every pair of adjacent 0's appear before any pair of adjacent 1's
Sankaranarayanan P.N
10.2k
views
Sankaranarayanan P.N
asked
Jun 24, 2016
Theory of Computation
regular-expression
theory-of-computation
+
–
1
votes
2
answers
548
ToC \ Reg Expression
Give a regular expression for L = {set of all strings in which number of a's are multiples of 3} ∑={a,b,c}
Give a regular expression for L = {set of all strings in which number of a's are multiples of 3}∑={a,b,c}
Desert_Warrior
3.1k
views
Desert_Warrior
asked
Jun 23, 2016
Unknown Category
theory-of-computation
regular-expression
+
–
2
votes
1
answer
549
STATE TRUE OR FALSE
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) (La)/a=L 4) a/(aL)=L
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) ...
Santhosh Devulapally
1.3k
views
Santhosh Devulapally
asked
Jun 20, 2016
Theory of Computation
regular
regular-expression
+
–
3
votes
2
answers
550
Write regular expression to denote a language L which accepts all the strings which begin or end with either 00 or 11
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).
im.raj
20.8k
views
im.raj
asked
Jun 16, 2016
Theory of Computation
theory-of-computation
regular-expression
peter-linz
+
–
1
votes
2
answers
551
construct a DFA to accept all strings which satisfy w(x)mod 5 =2 .
Don't you worry
5.3k
views
Don't you worry
asked
Jun 11, 2016
Theory of Computation
theory-of-computation
regular
regular-expression
finite-automata
+
–
1
votes
1
answer
552
Finite Automata
( 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)*
( 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)*
Alok12
784
views
Alok12
asked
Jun 6, 2016
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
2
votes
1
answer
553
UGC NET CSE | December 2015 | Part 3 | Question: 26
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 expression: $(a+b)^*bbb$ $abbb(a+b)^*$ $(a+b)^*(bbb)(a+b)^*$ $(a+b)(bbb)(a+b)^*$
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...
shekhar chauhan
3.2k
views
shekhar chauhan
asked
Jun 5, 2016
Theory of Computation
theory-of-computation
regular-expression
finite-automata
expression
ugcnetcse-dec2015-paper3
+
–
2
votes
0
answers
554
ISI2011-PCB-CS-4c
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 domain name. This is followed by an optional path specifier. Some example URLs are ... are the only characters that can be used in a host / domain / file / directory name, write a regular expression for URLs.
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...
go_editor
371
views
go_editor
asked
Jun 3, 2016
Theory of Computation
descriptive
isi2011-pcb-cs
regular-expression
+
–
2
votes
3
answers
555
What is the accepting state for this finite automaton ?
What is the complement of given DFA accepting :? What is the Regular expression for this FA ?
What is the complement of given DFA accepting :?What is the Regular expression for this FA ?
Don't you worry
1.2k
views
Don't you worry
asked
Jun 1, 2016
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
1
votes
1
answer
556
Regular expression for the language
L={w /na(w) + nb(w) =2 (mod 3)} Here na(w) is the no of a's in w
L={w /na(w) + nb(w) =2 (mod 3)}Here na(w) is the no of a's in w
Don't you worry
1.5k
views
Don't you worry
asked
Jun 1, 2016
Unknown Category
theory-of-computation
regular-expression
finite-automata
+
–
0
votes
2
answers
557
Write regular expressions for the following languages over the alphabet w= {a, b}:
(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.
(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.
Don't you worry
5.6k
views
Don't you worry
asked
Jun 1, 2016
Theory of Computation
theory-of-computation
regular-language
regular-expression
+
–
12
votes
3
answers
558
ISI2013-PCB-CS-4b
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.
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.
go_editor
1.6k
views
go_editor
asked
Jun 1, 2016
Theory of Computation
descriptive
isi2013-pcb-cs
theory-of-computation
regular-expression
+
–
2
votes
1
answer
559
regular expression
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
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
gate_forum
10.3k
views
gate_forum
asked
May 29, 2016
Theory of Computation
regular-expression
+
–
0
votes
2
answers
560
regular expression
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 followed by b and ending in string of a's and b's".
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...
gate_forum
2.1k
views
gate_forum
asked
May 28, 2016
Theory of Computation
regular-expression
+
–
0
votes
1
answer
561
regular expression
is L={ a^2n | n>=1 } regular? ans is yes My 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^n which doesn't lie in L(i.e. even no. of a's) so (xz)!=L pumping lemna contradiction?
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...
gate_forum
344
views
gate_forum
asked
May 26, 2016
Theory of Computation
regular-expression
+
–
2
votes
1
answer
562
Octal no.
In c,octal number have regular expression A.0(digit)* B.0(digit)+ C.0(digit) D.0
In c,octal number have regular expressionA.0(digit)*B.0(digit)+C.0(digit)D.0
Sourabh Kumar
697
views
Sourabh Kumar
asked
May 19, 2016
Programming in C
regular-expression
+
–
2
votes
3
answers
563
Peter Linz Edition 4 Exercise 3.1 Question 16.d (Page No. 76)
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 two as long as possible and consisting entirely of ... . For eg, the string abbbaab contains a run of b's of length three and a tun of a's of length two.
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 ...
Shubhi Tiwari
2.5k
views
Shubhi Tiwari
asked
May 11, 2016
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
regular-expression
+
–
1
votes
1
answer
564
right left quotient
explain with proper procedure is diagram must for such type of questions
explain with proper procedure is diagram must for such type of questions
Sanjay Sharma
885
views
Sanjay Sharma
asked
Apr 27, 2016
Theory of Computation
regular-expression
+
–
2
votes
2
answers
565
is a*b* is a regular expression ?
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 question .But as a non cs student i don't know what is going on in TOC .
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...
shekhar chauhan
852
views
shekhar chauhan
asked
Apr 22, 2016
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
1
votes
2
answers
566
What language does this FA represent ? And what is the regular expression for this FA ?
shekhar chauhan
1.1k
views
shekhar chauhan
asked
Apr 21, 2016
Theory of Computation
regular-expression
theory-of-computation
finite-automata
+
–
4
votes
4
answers
567
What Language Does this expression represents ( (0 + 1) (0 + 1)*)* 00 (0 + 1)*
shekhar chauhan
3.1k
views
shekhar chauhan
asked
Apr 19, 2016
Theory of Computation
theory-of-computation
regular-expression
+
–
3
votes
1
answer
568
find all strings in ((a+b)*b(a+ab)*) of length less then 4.
shekhar chauhan
5.5k
views
shekhar chauhan
asked
Apr 19, 2016
Theory of Computation
theory-of-computation
regular-expression
regular-language
+
–
3
votes
4
answers
569
regular exp[ression
Which of the following regular expression identities are true ? (A) (r + s)* = r* s* (B) (r + s)* = r* + s* (C) (r + s)* = (r*s*)* (D) r* s* = r* + s*
Which of the following regular expression identities are true ?(A) (r + s)* = r* s*(B) (r + s)* = r* + s*(C) (r + s)* = (r*s*)*(D) r* s* = r* + s*
Sanjay Sharma
16.0k
views
Sanjay Sharma
asked
Apr 13, 2016
Theory of Computation
regular-expression
+
–
3
votes
5
answers
570
#Regular Expression
The regular expression 0*(10*)* denotes the same set as (A) (1*0)*1* (B) 0 + (0 + 10)* (C) (0 + 1)* 10(0 + 1)* (D) none of these
The regular expression 0*(10*)* denotes the same set as(A) (1*0)*1*(B) 0 + (0 + 10)*(C) (0 + 1)* 10(0 + 1)*(D) none of these
Desert_Warrior
2.5k
views
Desert_Warrior
asked
Apr 13, 2016
Theory of Computation
theory-of-computation
regular-expression
+
–
Page:
« prev
1
...
14
15
16
17
18
19
20
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register