Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for regular+expression
64
votes
8
answers
1
GATE CSE 1997 | Question: 6.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)^*$
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^*$$...
Kathleen
37.5k
views
Kathleen
asked
Sep 29, 2014
Theory of Computation
gate1997
theory-of-computation
regular-expression
normal
+
–
56
votes
12
answers
2
GATE CSE 2003 | Question: 14
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
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
Kathleen
19.2k
views
Kathleen
asked
Sep 16, 2014
Theory of Computation
gatecse-2003
theory-of-computation
regular-expression
easy
+
–
31
votes
4
answers
3
GATE CSE 2022 | Question: 2
Which one of the following regular expressions correctly represents the language of the finite automaton given below? $ab^{\ast}bab^{\ast} + ba^{\ast}aba^{\ast}$ $(ab^{\ast}b)^{\ast}ab^{\ast} + (ba^{\ast}a)^{\ast} ba^{\ast}$ $(ab^{\ast}b + ba^{\ast}a)^{\ast} (a^{\ast} + b^{\ast})$ $(ba^{\ast}a + ab^{\ast}b)^{\ast} (ab^{\ast} + ba^{\ast})$
Which one of the following regular expressions correctly represents the language of the finite automaton given below?$ab^{\ast}bab^{\ast} + ba^{\ast}aba^{\ast}$$(ab^{\ast...
Arjun
17.6k
views
Arjun
asked
Feb 15, 2022
Theory of Computation
gatecse-2022
theory-of-computation
finite-automata
regular-expression
1-mark
+
–
68
votes
10
answers
4
GATE CSE 2010 | Question: 39
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^*$
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 express...
go_editor
22.3k
views
go_editor
asked
Sep 30, 2014
Theory of Computation
gatecse-2010
theory-of-computation
regular-expression
normal
+
–
24
votes
3
answers
5
GATE CSE 2020 | Question: 7
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^*$
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^*...
Arjun
23.6k
views
Arjun
asked
Feb 12, 2020
Theory of Computation
gatecse-2020
regular-expression
normal
theory-of-computation
1-mark
+
–
57
votes
4
answers
6
GATE CSE 2016 Set 1 | Question: 18
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$
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 )^ *001...
Sandeep Singh
20.8k
views
Sandeep Singh
asked
Feb 12, 2016
Theory of Computation
gatecse-2016-set1
theory-of-computation
regular-expression
normal
+
–
26
votes
5
answers
7
GATE CSE 2021 Set 2 | Question: 47
Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string $\epsilon$ is divisible by three. $(0+1(01^*0)^*1)^*$ $(0+11+10(1+00)^*01)^*$ $(0^*(1(01^*0)^*1)^*)^*$ $(0+11+11(1+00)^*00)^*$
Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string $\epsilon$ is divisible by three...
Arjun
12.3k
views
Arjun
asked
Feb 18, 2021
Theory of Computation
gatecse-2021-set2
multiple-selects
theory-of-computation
regular-expression
2-marks
+
–
42
votes
8
answers
8
GATE CSE 1992 | Question: 02,xvii
Which of the following regular expression identities is/are TRUE? $r^{(^\ast)} =r^\ast$ $(r^\ast s^\ast)=(r+s)^\ast$ $(r+s)^\ast = r^\ast + s^\ast$ $r^\ast s^\ast = r^\ast+s^\ast$
Which of the following regular expression identities is/are TRUE?$r^{(^\ast)} =r^\ast$$(r^\ast s^\ast)=(r+s)^\ast$$(r+s)^\ast = r^\ast + s^\ast$$r^\ast s^\ast = r^\ast+s^...
Kathleen
14.5k
views
Kathleen
asked
Sep 13, 2014
Theory of Computation
gate1992
theory-of-computation
regular-expression
easy
multiple-selects
+
–
11
votes
4
answers
9
GATE CSE 2023 | Question: 4
Consider the Deterministic Finite-state Automaton ($\text{DFA}$) $\mathcal{A}$ shown below. The $\text{DFA}$ runs on the alphabet $\{0,1\}$, and has the set of states $\{s, p, q, r\}$, with $s$ being the start state and $p$ being the only final state. Which one of the following ... $1\left(0^{*} 11\right)^{*}$ $0(0+1)^{*}$ $1(0+11)^{*}$ $1\left(110^{*}\right)^{*}$
Consider the Deterministic Finite-state Automaton ($\text{DFA}$) $\mathcal{A}$ shown below. The $\text{DFA}$ runs on the alphabet $\{0,1\}$, and has the set of states $\{...
admin
11.3k
views
admin
asked
Feb 15, 2023
Theory of Computation
gatecse-2023
theory-of-computation
regular-expression
1-mark
+
–
29
votes
9
answers
10
GATE CSE 1995 | Question: 1.9 , ISRO2017-13
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)^*$
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 ...
Kathleen
13.2k
views
Kathleen
asked
Oct 8, 2014
Theory of Computation
gate1995
theory-of-computation
regular-expression
easy
isro2017
+
–
8
votes
4
answers
11
GATE CSE 2023 | Question: 9
Consider the following definition of a lexical token $\textbf{id}$ for an identifier in a programming language, using extended regular expressions: \[ \begin{array}{ll} \textbf{ letter } & \rightarrow[\mathrm{A}-\mathrm{Za}-\mathrm{ ... Finite-state Automata with $\epsilon$-transitions accepts the set of valid identifiers? (A double-circle denotes a final state)
Consider the following definition of a lexical token $\textbf{id}$ for an identifier in a programming language, using extended regular expressions:\[\begin{array}{ll}\tex...
admin
8.6k
views
admin
asked
Feb 15, 2023
Theory of Computation
gatecse-2023
theory-of-computation
regular-expression
1-mark
+
–
33
votes
6
answers
12
GATE CSE 1991 | Question: 03,xiii
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(r) \subseteq L(s)$ and $L(s) \subseteq L(t)$ $L(s) \subseteq L(t)$ and $L(s) \subseteq L(r)$ $L(t) \subseteq L(s)$ and $L(s) \subseteq L(r)$ None of the above
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(r) \subs...
Kathleen
11.6k
views
Kathleen
asked
Sep 12, 2014
Theory of Computation
gate1991
theory-of-computation
regular-expression
normal
multiple-selects
+
–
28
votes
5
answers
13
GATE CSE 2000 | Question: 1.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$
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 \subs...
Kathleen
11.5k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2000
theory-of-computation
regular-expression
easy
+
–
33
votes
7
answers
14
GATE CSE 2009 | Question: 15
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}$ ... containing at least two $\text{0}$'s The set of all strings that begin and end with either $\text{0}$ or $\text{1}$
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 s...
Kathleen
14.9k
views
Kathleen
asked
Sep 22, 2014
Theory of Computation
gatecse-2009
theory-of-computation
regular-expression
easy
+
–
41
votes
7
answers
15
GATE CSE 1998 | Question: 1.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)^*$
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)^*$
Kathleen
23.2k
views
Kathleen
asked
Sep 25, 2014
Theory of Computation
gate1998
theory-of-computation
regular-expression
easy
multiple-selects
+
–
30
votes
6
answers
16
GATE CSE 1996 | Question: 1.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)
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) a...
Kathleen
10.2k
views
Kathleen
asked
Oct 9, 2014
Theory of Computation
gate1996
theory-of-computation
regular-expression
easy
+
–
54
votes
4
answers
17
GATE CSE 2014 Set 1 | Question: 36
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
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 onlyI and III onlyII and III onlyI, II an...
go_editor
18.9k
views
go_editor
asked
Sep 28, 2014
Theory of Computation
gatecse-2014-set1
theory-of-computation
regular-expression
finite-automata
easy
+
–
0
votes
0
answers
18
#TOC regular expression
what will be the regular expression of this DFA using Arden's theorem
what will be the regular expression of this DFA using Arden's theorem
prabhath challa
13
views
prabhath challa
asked
23 hours
ago
Theory of Computation
theory-of-computation
regular-expression
+
–
3
votes
1
answer
19
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 35
Which of the following strings are a member of the language described by the regular expression $\left(a^* {b} {a}^* b a^* b {a}^*\right)^*$ $b b b b$ $bbaaabb$ $bbaaabbbabb$ $b b a b b b a b$
Which of the following strings are a member of the language described by the regular expression $\left(a^* {b} {a}^* b a^* b {a}^*\right)^*$$b b b b$$bbaaabb$$bbaaabbbabb...
GO Classes
554
views
GO Classes
asked
Feb 5
Theory of Computation
goclasses2024-mockgate-14
theory-of-computation
regular-expression
multiple-selects
1-mark
+
–
44
votes
8
answers
20
GATE IT 2007 | Question: 73
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)^+$
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 regula...
Ishrat Jahan
14.0k
views
Ishrat Jahan
asked
Oct 30, 2014
Theory of Computation
gateit-2007
theory-of-computation
regular-expression
normal
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register