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
+14
votes
5
answers
1
GATE19983b
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed integer)
asked
Oct 17, 2014
in
Theory of Computation
by
Arjun
Veteran
(
431k
points)

1.8k
views
gate1998
theoryofcomputation
regularexpressions
easy
+20
votes
4
answers
2
GATE19961.8
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string). $(00)^ * (\varepsilon +0)$ $(00)^*$ $0^*$ $0(00)^*$ (i) and (ii) (ii) and (iii) (i) and (iii) (iii) and (iv)
asked
Oct 9, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

2k
views
gate1996
theoryofcomputation
regularexpressions
easy
+20
votes
7
answers
3
GATE19951.9 , ISRO201713
In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If $L$ and $D$ denote the sets of letters and digits respectively, which of the following expressions defines an identifier? $(L + D)^+$ $(L.D)^*$ $L(L + D)^*$ $L(L.D)^*$
asked
Oct 8, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

3.9k
views
gate1995
theoryofcomputation
regularexpressions
easy
isro2017
+22
votes
4
answers
4
GATE19942.10
The regular expression for the language recognized by the finite state automaton of figure is ______
asked
Oct 4, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

2.2k
views
gate1994
theoryofcomputation
finiteautomata
regularexpressions
easy
+4
votes
1
answer
5
Toc theorem proof
How $\phi^*=\epsilon$?
asked
Oct 4, 2014
in
Theory of Computation
by
Bhagirathi
Boss
(
14.4k
points)

534
views
theoryofcomputation
regularexpressions
proof
+41
votes
6
answers
6
GATE201039
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$
asked
Sep 30, 2014
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

4.9k
views
gate2010
theoryofcomputation
regularexpressions
normal
+31
votes
6
answers
7
GATE19976.4
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring? $0^*(1+0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
asked
Sep 29, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

6.9k
views
gate1997
theoryofcomputation
regularexpressions
normal
+35
votes
4
answers
8
GATE2014315
The length of the shortest string NOT in the language (over $\Sigma = \{a, b\})$ of the following regular expression is _______. $a^*b^*(ba)^*a^*$
asked
Sep 28, 2014
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

3.2k
views
gate20143
theoryofcomputation
regularexpressions
numericalanswers
easy
+39
votes
3
answers
9
GATE2014136
Which of the regular expressions given below represent the following DFA? $0^*1(1+00^*1)^* $ $0^*1^*1+11^*0^*1 $ $(0+1)^*1$ I and II only I and III only II and III only I, II and III
asked
Sep 28, 2014
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

4.5k
views
gate20141
theoryofcomputation
regularexpressions
finiteautomata
easy
+23
votes
7
answers
10
GATE19981.12
The string $1101$ does not belong to the set represented by $110^*(0 + 1)$ $1(0 + 1)^*101$ $(10)^*(01)^*(00 + 11)^*$ $(00 + (11)^*0)^*$
asked
Sep 26, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

4.9k
views
gate1998
theoryofcomputation
regularexpressions
easy
+24
votes
2
answers
11
GATE19981.9
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is true? $A \subset B$ $B \subset A$ $A$ and $B$ are incomparable $A = B$
asked
Sep 26, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

2.1k
views
gate1998
theoryofcomputation
regularexpressions
normal
+20
votes
4
answers
12
GATE200915
Which one of the following languages over the alphabet $\{0,1\}$ is described by the regular expression: $(0+1)^*0(0+1)^*0(0+1)^*$? The set of all strings containing the substring $\text{00}$ The set of all strings containing at most two $\text{0}$'s The set of all strings containing at least two $\text{0}$'s The set of all strings that begin and end with either $\text{0}$ or $\text{1}$
asked
Sep 22, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

1.8k
views
gate2009
theoryofcomputation
regularexpressions
easy
+41
votes
9
answers
13
GATE200314
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
asked
Sep 16, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

4.3k
views
gate2003
theoryofcomputation
regularexpressions
easy
+19
votes
3
answers
14
GATE20001.4
Let $S$ and $T$ be languages over $\Sigma=\{a.b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \phi$
asked
Sep 14, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

1.8k
views
gate2000
theoryofcomputation
regularexpressions
easy
+23
votes
5
answers
15
GATE199202,xvii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following regular expression identities is/are TRUE? $r^{(^*)} =r^*$ $(r^*s^*)=(r+s)^*$ $(r+s)^* = r^* + s^*$ $r^*s^* = r^*+s^*$
asked
Sep 13, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

2.1k
views
gate1992
theoryofcomputation
regularexpressions
easy
+21
votes
3
answers
16
GATE199103,xiii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only. Let $r=1(1+0)^*, s=11^*0 \text{ and } t=1^*0 $ be three regular expressions. Which one of the following is true? $L(s) \subseteq L(r)$ and $L(s) \subseteq L(t)$ ... $L(s) \subseteq L(r)$ $L(t) \subseteq L(s)$ and $L(s) \subseteq L(r)$ None of the above
asked
Sep 12, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.2k
points)

2.1k
views
gate1991
theoryofcomputation
regularexpressions
normal
Page:
« prev
1
...
12
13
14
15
16
17
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
@Abhisheksawarn608 what makes you think...
I am getting 151 marks excluding question not...
Thank you @Arjun sir :)
Thanks for that @rohit1001
@Dumbest Kid > Jocko Podcast
50,737
questions
57,295
answers
198,261
comments
104,971
users