Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged regular-expression
1
1 vote
1
1 answer
4.6k
4.6k views
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 regula...
go_editor
4.6k
views
asked
Jul 7, 2016
Theory of Computation
ugcnetcse-june2012-paper3
theory-of-computation
regular-expression
+
–
11
11 votes
1
answers
1 answer
8.4k
8.4k views
ISRO CSE 2016 | Question: 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...
Desert_Warrior
8.4k
views
asked
Jul 3, 2016
Theory of Computation
theory-of-computation
regular-expression
isro2016
+
–
2
2 votes
1
answers
1 answer
931
931 views
The meaning of the regular expression
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
931
views
asked
Jun 25, 2016
Theory of Computation
theory-of-computation
regular-expression
+
–
2
2 votes
1
answers
1 answer
8.3k
8.3k views
Regularity of the strings
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
8.3k
views
asked
Jun 24, 2016
Theory of Computation
regular-expression
regular-language
theory-of-computation
+
–
7
7 votes
4
answers
4 answers
33.6k
33.6k views
set of strings with atmost one pair of consecutive 0's and at most one pair of consecutive 1's
Sankaranarayanan P.N
33.6k
views
asked
Jun 24, 2016
Theory of Computation
theory-of-computation
regular-expression
+
–
4
4 votes
1
answers
1 answer
13.5k
13.5k views
The set of all strings in which every pair of adjacent 0's appear before any pair of adjacent 1's
Sankaranarayanan P.N
13.5k
views
asked
Jun 24, 2016
Theory of Computation
regular-expression
theory-of-computation
+
–
1
1 vote
2
answers
2 answers
4.7k
4.7k views
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}
Desert_Warrior
4.7k
views
asked
Jun 23, 2016
Unknown Category
theory-of-computation
regular-expression
+
–
2
2 votes
1
1 answer
1.6k
1.6k views
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) ...
Santhosh Devulapally
1.6k
views
asked
Jun 20, 2016
Theory of Computation
regular-expression
+
–
4
4 votes
2
answers
2 answers
25.6k
25.6k views
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
25.6k
views
asked
Jun 16, 2016
Theory of Computation
theory-of-computation
regular-expression
peter-linz
+
–
1
1 vote
2
answers
2 answers
7.1k
7.1k views
construct a DFA to accept all strings which satisfy w(x)mod 5 =2 .
Don't you worry
7.1k
views
asked
Jun 11, 2016
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
1
1 vote
2
2 answers
3.2k
3.2k views
Automata Regular expression
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
shekhar chauhan
3.2k
views
asked
Jun 8, 2016
Theory of Computation
theory-of-computation
finite-automata
regular-expression
expression
+
–
0
0 votes
3
answers
3 answers
3.5k
3.5k views
Finite Automata Regular Expression
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...
shekhar chauhan
3.5k
views
asked
Jun 6, 2016
Theory of Computation
finite-automata
theory-of-computation
expression
regular-expression
regular-language
+
–
1
1 vote
1
1 answer
1.2k
1.2k views
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)*
Alok12
1.2k
views
asked
Jun 6, 2016
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
2
2 votes
1
1 answer
4.0k
4.0k views
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 expressio...
shekhar chauhan
4.0k
views
asked
Jun 5, 2016
Theory of Computation
theory-of-computation
regular-expression
finite-automata
expression
ugcnetcse-dec2015-paper3
+
–
2
2 votes
1
1 answer
597
597 views
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 d...
go_editor
597
views
asked
Jun 3, 2016
Theory of Computation
descriptive
isi2011-pcb-cs
regular-expression
+
–
2
2 votes
3
answers
3 answers
1.8k
1.8k views
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 ?
Don't you worry
1.8k
views
asked
Jun 1, 2016
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
1
1 vote
1
answers
1 answer
1.8k
1.8k views
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
Don't you worry
1.8k
views
asked
Jun 1, 2016
Unknown Category
theory-of-computation
regular-expression
finite-automata
+
–
0
0 votes
2
answers
2 answers
10.0k
10.0k views
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.
Don't you worry
10.0k
views
asked
Jun 1, 2016
Theory of Computation
theory-of-computation
regular-language
regular-expression
+
–
12
12 votes
4
answers
4 answers
3.2k
3.2k views
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.
go_editor
3.2k
views
asked
Jun 1, 2016
Theory of Computation
descriptive
isi2013-pcb-cs
theory-of-computation
regular-expression
+
–
1
1 vote
1
1 answer
7.2k
7.2k views
regular expression
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 ".
gate_forum
7.2k
views
asked
May 31, 2016
Unknown Category
regular-expression
expression
+
–
1
1 vote
1
answers
1 answer
2.8k
2.8k views
regular expression algebra
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
gate_forum
2.8k
views
asked
May 29, 2016
Theory of Computation
regular-expression
expression
+
–
2
2 votes
1
answers
1 answer
12.2k
12.2k views
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
gate_forum
12.2k
views
asked
May 29, 2016
Theory of Computation
regular-expression
+
–
0
0 votes
2
answers
2 answers
2.7k
2.7k views
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 followe...
gate_forum
2.7k
views
asked
May 28, 2016
Theory of Computation
regular-expression
+
–
0
0 votes
1
1 answer
553
553 views
regular expression
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
553
views
asked
May 26, 2016
Theory of Computation
regular-expression
+
–
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.
ManojK
1.5k
views
asked
May 23, 2016
Theory of Computation
regular-expression
+
–
2
2 votes
1
1 answer
1.5k
1.5k views
Octal no.
In c,octal number have regular expressionA.0(digit)*B.0(digit)+C.0(digit)D.0
Sourabh Kumar
1.5k
views
asked
May 19, 2016
Programming in C
regular-expression
+
–
2
2 votes
3
answers
3 answers
3.4k
3.4k views
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 t...
Shubhi Tiwari
3.4k
views
asked
May 11, 2016
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
regular-expression
+
–
1
1 vote
1
1 answer
1.2k
1.2k views
right left quotient
explain with proper procedure is diagram must for such type of questions
Sanjay Sharma
1.2k
views
asked
Apr 27, 2016
Theory of Computation
regular-expression
+
–
2
2 votes
2
answers
2 answers
1.4k
1.4k views
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 quest...
shekhar chauhan
1.4k
views
asked
Apr 22, 2016
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
1
1 vote
2
answers
2 answers
2.1k
2.1k views
What language does this FA represent ? And what is the regular expression for this FA ?
shekhar chauhan
2.1k
views
asked
Apr 21, 2016
Theory of Computation
regular-expression
theory-of-computation
finite-automata
+
–
Page:
« prev
1
...
17
18
19
20
21
22
23
24
next »