Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Recent questions tagged regularexpressions
0
votes
0
answers
Gate Mock Test
Isn’t this expression $E^+.E^+ = E^+$ wrong? Let $\sum = {a, b}$ then $E^+$ will have ‘a’ & ‘b’ as the smallest string but $E^+.E^+$ will have ‘aa’, ‘ab’, ‘ba’ & ‘bb’ as its smallest string. There will not be any string of length 1. So, $E^+.E^+ \neq E^+$.
asked
Jul 29
in
Theory of Computation
by
Chiranmoy
(
6
points)

17
views
regularexpressions
0
votes
0
answers
Gate2008IT200832
Why is it so that solving by converting from FA (state diagram given) to RE gives different solution as compared to ARDENS theorem. What is the RE of the state diagram , given in the question by using ARDENS theorem
asked
Jul 18
in
Theory of Computation
by
prajjwalsingh_11
(
22
points)

5
views
theoryofcomputation
finiteautomata
regularexpressions
#ardenstheorem
0
votes
0
answers
GATE19976.4 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate1997
theoryofcomputation
regularexpressions
normal
videosolution
0
votes
0
answers
GATE2016118 Video Solution
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate20161
theoryofcomputation
regularexpressions
normal
videosolution
0
votes
0
answers
GATE201039 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

3
views
gate2010
theoryofcomputation
regularexpressions
normal
videosolution
0
votes
0
answers
GATE19981.12 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

3
views
gate1998
theoryofcomputation
regularexpressions
easy
videosolution
0
votes
0
answers
GATE2014136 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate20141
theoryofcomputation
regularexpressions
finiteautomata
easy
videosolution
0
votes
0
answers
GATE200314 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

4
views
gate2003
theoryofcomputation
regularexpressions
easy
videosolution
0
votes
0
answers
GATE19951.9 , ISRO201713 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

0
views
gate1995
theoryofcomputation
regularexpressions
easy
isro2017
videosolution
0
votes
0
answers
GATE2007IT73 Video Solution
Consider the regular expression $R = (a + b)^* \ (aa + bb) \ (a + b)^*$ Which one of the regular expressions given below defines the same language as defined by the regular expression $R$ ? $(a(ba)^* + b(ab)^*)(a + b)^+$ $(a(ba)^* + b(ab)^*)^*(a + b)^*$ $(a(ba)^* (a + bb) + b(ab)^*(b + aa))(a + b)^*$ $(a(ba)^* (a + bb) + b(ab)^*(b + aa))(a + b)^+$
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate2007it
theoryofcomputation
regularexpressions
normal
videosolution
0
votes
0
answers
GATE2014315 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

1
view
gate20143
theoryofcomputation
regularexpressions
numericalanswers
easy
videosolution
0
votes
0
answers
GATE2004IT7 Video Solution
Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$? $(a^* + b^* + c^*)^*$ $(a^*b^*c^*)^*$ $((ab)^* + c^*)^*$ $(a^*b^* + c^*)^*$
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

5
views
gate2004it
theoryofcomputation
regularexpressions
normal
videosolution
0
votes
0
answers
GATE2005IT5 Video Solution
Which of the following statements is TRUE about the regular expression $01^*0$? It represents a finite set of finite strings. It represents an infinite set of finite strings. It represents a finite set of infinite strings. It represents an infinite set of infinite strings.
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

1
view
gate2005it
theoryofcomputation
regularexpressions
easy
videosolution
0
votes
0
answers
GATE19981.9 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

1
view
gate1998
theoryofcomputation
regularexpressions
normal
videosolution
0
votes
0
answers
GATE199202,xvii Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

5
views
gate1992
theoryofcomputation
regularexpressions
easy
videosolution
0
votes
0
answers
GATE20001.4 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate2000
theoryofcomputation
regularexpressions
easy
videosolution
0
votes
0
answers
GATE19942.10 Video Solution
The regular expression for the language recognized by the finite state automaton of figure is ______
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

3
views
gate1994
theoryofcomputation
finiteautomata
regularexpressions
easy
videosolution
0
votes
0
answers
GATE199103,xiii Video Solution
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)$ ... $L(s) \subseteq L(r)$ $L(t) \subseteq L(s)$ and $L(s) \subseteq L(r)$ None of the above
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

3
views
gate1991
theoryofcomputation
regularexpressions
normal
videosolution
0
votes
0
answers
GATE19961.8 Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate1996
theoryofcomputation
regularexpressions
easy
videosolution
+1
vote
1
answer
GATE2020CS7 Video Solution
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s? $((0+1)^*1(0+1)^*1)^*10^*$ $(0^*10^*10^*)^*0^*1$ $10^*(0^*10^*10^*)^*$ $(0^*10^*10^*)^*10^*$
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

37
views
gate2020cs
regularexpressions
normal
theoryofcomputation
videosolution
0
votes
0
answers
GATE200915 Video Solution
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}$ ... containing at least two $\text{0}$'s The set of all strings that begin and end with either $\text{0}$ or $\text{1}$
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate2009
theoryofcomputation
regularexpressions
easy
videosolution
0
votes
0
answers
GATE19983b Video Solution
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
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

3
views
gate1998
theoryofcomputation
regularexpressions
easy
videosolution
0
votes
0
answers
GATE2008IT5 Video Solution
Which of the following regular expressions describes the language over$\{0, 1\}$ consisting of strings that contain exactly two $1$'s? $(0 + 1)^ * \ 11(0 + 1) ^*$ $0 ^* \ 110 ^*$ $0 ^* 10 ^* 10 ^*$ $(0 + 1) ^* 1(0 + 1) ^* 1 (0 + 1) ^*$
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate2008it
theoryofcomputation
regularexpressions
easy
videosolution
0
votes
0
answers
GATE198710d Video Solution
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper nonnull substrings of the string $0110$.
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

4
views
gate1987
theoryofcomputation
regularexpressions
videosolution
0
votes
0
answers
GATE2006IT5 Video Solution
Which regular expression best describes the language accepted by the nondeterministic automaton below? $(a + b)^* \ a(a + b)b$ $(abb)^*$ $(a + b)^* \ a(a + b)^* \ b(a + b)^*$ $(a + b)^*$
asked
Apr 18
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate2006it
theoryofcomputation
regularexpressions
normal
videosolution
To see more, click for the
full list of questions
or
popular tags
.
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
Top Users
2020 Aug 03  09
Ashutosh07091999
19 Points
Mellophi
17 Points
prashastinama
6 Points
manas_kulkarni
4 Points
srestha
2 Points
Unnayan kumar
1 Points
aryashah2k
1 Points
Jhaiyam
1 Points
nvs16
1 Points
prabhat0987
1 Points
Weekly Top User (excluding moderators) will get free access to
GATE Overflow Test Series for GATE 2021
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Aug 2020
Mellophi
23 Points
Ashutosh07091999
22 Points
Unnayan kumar
8 Points
Sourav Kar
7 Points
anurag_yo
7 Points
Shaik Masthan
7 Points
prashastinama
6 Points
sureshthiyam
6 Points
manas_kulkarni
6 Points
srestha
4 Points
7,689
questions
1,816
answers
11,054
comments
95,077
users