menu
Recent questions tagged regular-expressions
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged regular-expressions
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged regular-expressions
0
votes
0
answers
39
views
Gate applied
Can some one please do a pumping lema on L = {a^(2n+1) | n>=0 } I know Finite automata can be easily made and hence it is a regular language, but the pumping lema test fails for this implying it is a non-regular language (I am sure I am doing the pumping lema wrong) can someone please do a pumping lema for this so that I compare my solution and rectify my mistake
pavan.varyani
asked
in
Theory of Computation
Dec 7, 2021
by
pavan.varyani
5
points
39
views
toc-languages
regular-expressions
pumping-lemma
0
votes
1
answer
85
views
TOC - Regular Expressions
As for a Finite Automata, we say a finite automata accepts a language if it accepts all strings present in the language as well as REJECTS all strings which are not present in the language. Is the definition for a regular language the same as that ... all strings of the regular language as well as NOT represent any strings not part of the language ?? Pls clear this.
Rutuja Desai
asked
in
Theory of Computation
Oct 27, 2021
by
Rutuja Desai
5
points
85
views
toc-languages
regular-expressions
self-doubt
regular-languages
0
votes
1
answer
73
views
applied gate test
how many states are in smallest possible DFA {0,1} * {$1^{10}$}
Nilabja Sarkar
asked
in
Theory of Computation
Aug 30, 2021
by
Nilabja Sarkar
5
points
73
views
toc-languages
regular-expressions
0
votes
0
answers
68
views
MadeEasy TOC question
hi, this is MadeEasy TOC question. It mentions to eliminate X first and then Y. How can this be done, I mean how can we eliminate X and Y since even after subsitution they will be repeating. I know here we have to use arden’s theorem but unable to understand how to reduce. Please help…....….
rish1602
asked
in
Theory of Computation
Jun 25, 2021
by
rish1602
9
points
68
views
ardens-theorem
theory-of-computation
made-easy-test-series
regular-expressions
0
votes
0
answers
35
views
Clear distinction between Finite automata, Regular expressions
akshansh
asked
in
Theory of Computation
Jun 12, 2021
by
akshansh
15
points
35
views
toc-languages
regular-expressions
nfa-dfa
3
votes
1
answer
787
views
GATE CSE 2021 Set 2 | Question: 47 | Video Solution
Arjun
asked
in
Theory of Computation
Feb 18, 2021
by
Arjun
1.4k
points
787
views
gate2021-cse-set2
multiple-selects
theory-of-computation
regular-expressions
0
votes
1
answer
89
views
Made Easy Test Series
Can anyone Explain or provide the complete methodology
prajjwalsingh_11
asked
in
Theory of Computation
Aug 6, 2020
by
prajjwalsingh_11
15
points
89
views
theory-of-computation
regular-expressions
made-easy-test-series
0
votes
0
answers
34
views
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^+$.
Chiranmoy
asked
in
Theory of Computation
Jul 29, 2020
by
Chiranmoy
5
points
34
views
regular-expressions
0
votes
0
answers
42
views
Gate-2008-IT-2008-32
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
prajjwalsingh_11
asked
in
Theory of Computation
Jul 18, 2020
by
prajjwalsingh_11
15
points
42
views
theory-of-computation
finite-automata
regular-expressions
ardens-theorem
0
votes
0
answers
27
views
GATE1997-6.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)^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
27
views
gate1997
theory-of-computation
regular-expressions
normal
video-solution
0
votes
0
answers
18
views
GATE2016-1-18 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$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
18
views
gate2016-1
theory-of-computation
regular-expressions
normal
video-solution
0
votes
0
answers
16
views
GATE2010-39 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^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
16
views
gate2010
theory-of-computation
regular-expressions
normal
video-solution
0
votes
0
answers
19
views
GATE1998-1.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)^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
19
views
gate1998
theory-of-computation
regular-expressions
easy
video-solution
0
votes
0
answers
44
views
GATE2014-1-36 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
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
44
views
gate2014-1
theory-of-computation
regular-expressions
finite-automata
easy
video-solution
0
votes
0
answers
16
views
GATE2003-14 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
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
16
views
gate2003
theory-of-computation
regular-expressions
easy
video-solution
0
votes
0
answers
16
views
GATE1995-1.9 , ISRO2017-13 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)^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
16
views
gate1995
theory-of-computation
regular-expressions
easy
isro2017
video-solution
0
votes
0
answers
13
views
GATE2007-IT-73 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)^+$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
13
views
gate2007-it
theory-of-computation
regular-expressions
normal
video-solution
0
votes
0
answers
15
views
GATE2014-3-15 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^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
15
views
gate2014-3
theory-of-computation
regular-expressions
numerical-answers
easy
video-solution
0
votes
0
answers
19
views
GATE2004-IT-7 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^*)^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
19
views
gate2004-it
theory-of-computation
regular-expressions
normal
video-solution
0
votes
0
answers
16
views
GATE2005-IT-5 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.
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
16
views
gate2005-it
theory-of-computation
regular-expressions
easy
video-solution
0
votes
0
answers
13
views
GATE1998-1.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$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
13
views
gate1998
theory-of-computation
regular-expressions
normal
video-solution
0
votes
0
answers
56
views
GATE1992-02,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^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
56
views
gate1992
theory-of-computation
regular-expressions
easy
video-solution
0
votes
0
answers
7
views
GATE2000-1.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$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
7
views
gate2000
theory-of-computation
regular-expressions
easy
video-solution
0
votes
0
answers
28
views
GATE1994-2.10 Video Solution
The regular expression for the language recognized by the finite state automaton of figure is ______
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
28
views
gate1994
theory-of-computation
finite-automata
regular-expressions
easy
video-solution
0
votes
0
answers
18
views
GATE1991-03,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
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
18
views
gate1991
theory-of-computation
regular-expressions
normal
video-solution
0
votes
0
answers
18
views
GATE1996-1.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)
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
18
views
gate1996
theory-of-computation
regular-expressions
easy
video-solution
1
vote
1
answer
110
views
GATE2020-CS-7 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^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
110
views
gate2020-cs
regular-expressions
normal
theory-of-computation
video-solution
0
votes
0
answers
15
views
GATE2009-15 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}$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
15
views
gate2009
theory-of-computation
regular-expressions
easy
video-solution
0
votes
0
answers
14
views
GATE1998-3b 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)
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
14
views
gate1998
theory-of-computation
regular-expressions
easy
video-solution
0
votes
0
answers
18
views
GATE2008-IT-5 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) ^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
18
views
gate2008-it
theory-of-computation
regular-expressions
easy
video-solution
0
votes
0
answers
56
views
GATE1987-10d Video Solution
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
56
views
gate1987
theory-of-computation
regular-expressions
video-solution
0
votes
0
answers
24
views
GATE2006-IT-5 Video Solution
Which regular expression best describes the language accepted by the non-deterministic automaton below? $(a + b)^* \ a(a + b)b$ $(abb)^*$ $(a + b)^* \ a(a + b)^* \ b(a + b)^*$ $(a + b)^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
24
views
gate2006-it
theory-of-computation
regular-expressions
normal
video-solution
To see more, click for the
full list of questions
or
popular tags
.
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts