The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged regularexpressions
Materials needed
Stanford slides
Colostate slides
+1
vote
3
answers
1
Theory of computation
asked
Jun 6, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.9k
points)

142
views
regularexpressions
+1
vote
1
answer
2
Theory of computation
asked
Jun 6, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.9k
points)

86
views
regularexpressions
0
votes
1
answer
3
WBUT 2011
Construct a NFA for $r=(11+0)^*(00+1)^*$
asked
May 27, 2018
in
Theory of Computation
by
Sourav_35
(
171
points)

129
views
nfadfa
regularexpressions
theoryofcomputation
0
votes
2
answers
4
Doubt .... Theory of Computation ..... Regular Expression
Design regular expression for no $2$ $a's$ should come together ...... (Standard question in many text books) I came to know the answer is .... $(a + E) (b + ba)$ or $(b + ab) (a + E)$ ...... this I ... ....... please help me with any case or scenario where my expression fails. This community is always helpful to me. Thanks in advance ...
asked
May 21, 2018
in
Theory of Computation
by
abhiram144
(
281
points)

129
views
theoryofcomputation
regularexpressions
+1
vote
1
answer
5
Doubt ..... Theory of Computing
find regular expression over $\{a,b\}$ corresponding to "set of strings containing Exactly $2a's$.". I have come up with two answers and are seeming Logically correct to me. Please correct me If I am wrong. 1. $b^* a b^* a b^*$  This will ... In the middle of $2 a's$ and $2 a's$ at the end. I am wondering if both of them are correct. Thanks in advance.
asked
May 20, 2018
in
Theory of Computation
by
abhiram144
(
281
points)

90
views
theoryofcomputation
regularexpressions
0
votes
1
answer
6
Regular expression#previous year gate
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ number of $1's$ and preceded by at least $k$ number of $1's$ ($k$ is a fixed integer).Choose the correct one out of two. $1^*1^k(01^k)^*1^*$ $1^*(1^k01^k)^*$
asked
May 20, 2018
in
Theory of Computation
by
MeghnaJain
(
9
points)

147
views
theoryofcomputation
regularexpressions
0
votes
0
answers
7
what is the regular expression and design dfa and nfa for arthimatic expression
asked
May 13, 2018
in
Theory of Computation
by
doaa
(
17
points)

145
views
finiteautomata
theoryofcomputation
regularexpressions
nfadfa
0
votes
0
answers
8
FA to Regular Expression: when no two a's and no two b's should come together
I wanted to covert the finite automata of the question 'when no two a's and no two b's should come together' to regular expression. But I am not able to do so. I have attached my working. Kindly see it and please ... C) or viceversa and draw it as a FA. Please also show the diagram if I eliminate B after eliminating C.
asked
May 9, 2018
in
Theory of Computation
by
surbhijain93
(
291
points)

443
views
theoryofcomputation
regularexpressions
finiteautomata
0
votes
1
answer
9
Peter Linz Chapter 4.3 Exercise Q.20
I don't think it will be regular . Had the language been uwwRv the expression could have been (a+b)*(aa+bb)(a+b)* as there is no restriction on w. Is it correct? and if it isn't regular, is it a CFL?
asked
May 4, 2018
in
Theory of Computation
by
Subham Nagar
Active
(
1.1k
points)

136
views
theoryofcomputation
regularlanguages
regularexpressions
0
votes
1
answer
10
Peter Linz Chapter 4
L = {a^n: n ≥ 2, is a prime number}. This is not a regular language. What about L*? Is it regular? Please explain.
asked
May 4, 2018
in
Theory of Computation
by
Subham Nagar
Active
(
1.1k
points)

106
views
theoryofcomputation
regularexpressions
regularlanguages
0
votes
2
answers
11
TOC question on Regular expresstion
Find length of string of minimum length on {0,1}* not in the language corressponding to the given RE 0^*(01^*)^* options are 1 2 3 None of these Is it asking to find the minimum length string and then length of it if yes then minimum length can be ... ans is 1 plzz rectify me if I have not understand the question properly second RE 1^*(0+10)^* options are 2 3 4 5
asked
May 1, 2018
in
Theory of Computation
by
sanju77767
(
211
points)

91
views
regularexpressions
+2
votes
2
answers
12
Regular Expressions
Can (ab* + b)* be written as (a + b)*.If so then how?
asked
Apr 7, 2018
in
Theory of Computation
by
Sourav_35
(
171
points)

237
views
regularexpressions
+2
votes
2
answers
13
Random
Let $'r'$ be a regular expression, then which of the following statements is/are TRUE for every $'r'$? $\qquad S1: \text{There exists 'x' which satisfies property } r + x =x$. $\qquad S1: \text{There exists 'x' which satisfies property } r .x =x$. $\text{S1 is FALSE, S2 is FALSE}$ $\text{S1 is FALSE, S2 is TRUE}$ $\text{S1 is TRUE, S2 is FALSE}$ $\text{S1 is TRUE, S2 is TRUE}$
asked
Mar 30, 2018
in
Theory of Computation
by
Shivani gaikawad
Junior
(
633
points)

114
views
theoryofcomputation
regularexpressions
+1
vote
1
answer
14
Gateforum booklet
asked
Mar 30, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.9k
points)

90
views
regularexpressions
+2
votes
1
answer
15
Gateforum booklet
Which of the following is false? Regular sets are closed under substitution Regular sets are closed under homomorphism Regular sets are closed under inverse homomorphism Regular sets are closed under quotient with nonregular sets. iv) only iii) and iv) only iii) only None of these
asked
Mar 30, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.9k
points)

63
views
regularexpressions
0
votes
2
answers
16
Peter linz exercise 3.1 qsn 20(c)
Give regular expression for all strings containing odd number of zeros on $\{0,1\}$
asked
Mar 21, 2018
in
Theory of Computation
by
Kakashi
(
17
points)

141
views
theoryofcomputation
regularexpressions
0
votes
1
answer
17
theory of computation
Let $L=\{w \in \{0,1\}^∗\mid \text{number of occurences of }(110)=\text{number of occurences of } (011)\}$ What is $L$?
asked
Mar 21, 2018
in
Theory of Computation
by
varunraj
Active
(
1.1k
points)

124
views
theoryofcomputation
regularexpressions
+1
vote
1
answer
18
Peter Linz Edition 4 Exercise 3.1 Question 28 (Page No. 77)
Find a regular expression for all bit strings, with leading bit 1, interpreted as a binary integer, with values not between 10 and 30.
asked
Mar 15, 2018
in
Theory of Computation
by
Mk Utkarsh
Boss
(
36.6k
points)

307
views
theoryofcomputation
peterlinz
regularexpressions
0
votes
1
answer
19
Peter Linz Edition 4 Exercise 3.1 Question 27 (Page No. 77)
Find a regular expression that denotes all bit strings whose value, when interpreted as a binary integer, is greater than or equal to 40.
asked
Mar 15, 2018
in
Theory of Computation
by
Mk Utkarsh
Boss
(
36.6k
points)

233
views
theoryofcomputation
peterlinz
regularexpressions
regulargrammar
+1
vote
1
answer
20
Peter Linz Edition 4 Exercise 3.1 Question 17.d (Page No. 76)
$\sum = \left \{ 0,1 \right \}$ Give a regular expression for all strings having at least two occurrences of the substring 00. (Note that with the usual interpretation of a substring, 000 counts two such occurences)
asked
Mar 15, 2018
in
Theory of Computation
by
Mk Utkarsh
Boss
(
36.6k
points)

155
views
theoryofcomputation
peterlinz
regularexpressions
0
votes
2
answers
21
Peter Linz Edition 4 Exercise 3.1 Question 16.c (Page No. 76)
Give regular expression for the following language on $\sum = \left \{ a,b,c \right \}$ All strings that contain at least one occurrence of each symbol in $\sum$
asked
Mar 14, 2018
in
Theory of Computation
by
Mk Utkarsh
Boss
(
36.6k
points)

186
views
theoryofcomputation
peterlinz
regularlanguages
regularexpressions
+2
votes
1
answer
22
Peter Linz Edition 4 Exercise 3.1 Question 10 (Page No. 76)
Give a regular expression for L = $\left \{a^{n}b^{m};n\geq 1,m \geq 1,nm \geq3 \right \}$
asked
Mar 14, 2018
in
Theory of Computation
by
Mk Utkarsh
Boss
(
36.6k
points)

270
views
theoryofcomputation
peterlinz
regularexpressions
+2
votes
1
answer
23
Peter Linz Edition 4 Exercise 3.1 Question 9 (Page No. 76)
Give a regular expression for $L^{R}$ L = $(a+bc)^{*}(c+\phi)$
asked
Mar 14, 2018
in
Theory of Computation
by
Mk Utkarsh
Boss
(
36.6k
points)

93
views
theoryofcomputation
regularlanguages
peterlinz
regularexpressions
+3
votes
1
answer
24
#TOC Doubt  Regular expressions
Part A: Given : (bab*ab*)* How can it be interpreted as: 1.((b+ab*)ab*)* 2.(b+(ab*ab*))* 3.((b+a)b*ab*)* Part B: 1.What will be its NFA ? 2.Can we draw a direct MINIMAL DFA for such questions?
asked
Mar 13, 2018
in
Theory of Computation
by
ashishgateashish
(
83
points)

177
views
regularexpressions
finiteautomata
nfadfa
theoryofcomputation
+1
vote
0
answers
25
Dfa to regex
please verify the regex
asked
Mar 12, 2018
in
Theory of Computation
by
Mk Utkarsh
Boss
(
36.6k
points)

92
views
theoryofcomputation
finiteautomata
regularexpressions
+1
vote
1
answer
26
ISRO exam
Cfg for regular expression $(ab+a)^* (aa+b)$
asked
Mar 9, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.9k
points)

124
views
theoryofcomputation
regularexpressions
+1
vote
0
answers
27
Regular Expression
What is the regular expression of $L = \{ s \in L$ $i$ = no of $1$ in string $s$ $j$ = no of $0$ in string $s$ $i+j$ is odd $\}$ ???
asked
Mar 4, 2018
in
Theory of Computation
by
Dharmesh Gusai
(
13
points)

135
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
+1
vote
2
answers
28
Doubt
What is identity for regular expressions ?
asked
Feb 10, 2018
in
Theory of Computation
by
Angkit
Active
(
3.6k
points)

90
views
regularexpressions
+7
votes
1
answer
29
CMI2017A01
The regular expression $(a^*+b)^*$ is equivalent to which of the following regular expressions: $a^*b^*$ $(a^*b+b)^*$ $(a+b^*)^*$ $(a^*b)^*$
asked
Feb 5, 2018
in
Theory of Computation
by
Tesla!
Boss
(
18.4k
points)

419
views
cmi2017
theoryofcomputation
regularexpressions
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
12
...
17
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged regularexpressions
Recent Blog Comments
Anyone knows when the revised key will be...
You will definitely get selected. All the best...
Am getting 108 and I belong to obc category. Is...
Shut the f up and study.. If u get to the...
@devendhar, yes ....great chances of...
50,737
questions
57,406
answers
198,629
comments
105,468
users