The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged regularlanguages
0
votes
0
answers
1
Virtual GATE
Let A be a regular set. Consider the two sets below L1={x  $\exists n\geq 0, \exists y\epsilon A :$ y=$x^n$} L2={x  $\exists n\geq 0, \exists y\epsilon A :$ x=$y^n$} which of the following statements is true? L1 and L2 both are regular L1 is regular but L2 is not L1 is not regular but L2 is L1 and L2 both are nonregular
asked
1 day
ago
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

18
views
virtualgate
testseries
theoryofcomputation
regularlanguages
regularexpressions
0
votes
1
answer
2
Peter Linz Edition 4 Exercise 4.3 Question 6 (Page No. 122)
Given L1={$a^nb^n$n$\geqslant 1$} , L2={$a^nb^m$n$\geq 1$, m$\geq 1$}, L3={$a^nb^{n+2}$n$\geqslant 1$} if L1 $\cup$ L2 is regular then why L1 $\cup$ L3 is not regular? also what is the language of L1 $\cup$ L3?
asked
Feb 25
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

133
views
theoryofcomputation
peterlinz
regularlanguages
regulargrammar
closureproperty
0
votes
1
answer
3
Peter Linz Edition 4 Exercise 3.1 Question 5 (Page No. 75)
what is the regular grammar for L={$a^nb^m$  n+m is even}
asked
Feb 24
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

152
views
theoryofcomputation
peterlinz
finiteautomata
regularlanguages
regularexpressions
regulargrammar
+1
vote
0
answers
4
Peter Linz Edition 4 Exercise 3.3 Question 6 (Page No. 97)
Construct a right linear grammar for the language L(aab*ab)* is this grammar correct? S>aaA  ε A>bA  abA  S
asked
Feb 24
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

42
views
theoryofcomputation
peterlinz
finiteautomata
regularlanguages
regulargrammar
+1
vote
1
answer
5
Peter Linz Edition 4 Exercise 3.2 Question 10.b (Page No. 88)
What is the regular expression for this
asked
Feb 22
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

142
views
theoryofcomputation
peterlinz
finiteautomata
regularlanguages
regularexpressions
0
votes
1
answer
6
Peter Linz Edition 4 Exercise 2.1 Question 9.a (Page No. 48)
Construct a DFA on {0, 1} where every 00 is followed immediately by 1
asked
Feb 19
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

98
views
theoryofcomputation
peterlinz
finiteautomata
regularlanguages
+2
votes
4
answers
7
GATE20197
asked
Feb 7
in
Theory of Computation
by
Arjun
Veteran
(
386k
points)

1.7k
views
gate2019
theoryofcomputation
regularlanguages
0
votes
1
answer
8
Madeeasytestseries Regular language
Consider the following language: L = {w w $\epsilon$ {0,1}* ; w has equal number of occurances of 001' and 010' } The solution they provided: The absolute difference between the number of occurrences of 001' and 010' is at most 1. Hence ... an occurrence of 010' (and viceversa)). But, since such info is not given, so how this can be a regular language?
asked
Jan 29
in
Theory of Computation
by
Harsh Kumar
Active
(
1k
points)

57
views
madeeasytestseries
theoryofcomputation
regularlanguages
0
votes
1
answer
9
MadeEasy Test Series 2019: Thoery of Computation  Regular Languages
Is the following language regular or not?
asked
Jan 25
in
Theory of Computation
by
Anu Sreenivasan Unni
(
89
points)

88
views
theoryofcomputation
regularlanguages
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
10
ME_test_series
Consider the following languages: Which of the above languages are regular? My Doubt : How come I is regular?
asked
Jan 23
in
Theory of Computation
by
Shivam Kasat
Active
(
1.9k
points)

61
views
theoryofcomputation
madeeasytestseries
regularlanguages
+1
vote
0
answers
11
AAI Mock 4  TOC
Which of the following are regular languages?
asked
Jan 23
in
Theory of Computation
by
muthu kumar
Active
(
1.5k
points)

40
views
regularlanguages
finiteautomata
theoryofcomputation
0
votes
2
answers
12
language
ϕ Σ* L X
asked
Jan 22
in
Theory of Computation
by
Rahul_Rathod_
Junior
(
565
points)

72
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
contextfreelanguage
0
votes
0
answers
13
A language is cfl or not
L = {a^(p+q) b^(p+q) a^p , p,q>=0} Which one of the following is true about L? L is a regular L is CFL but not regular L is not a CFL
asked
Jan 22
in
Theory of Computation
by
saptarshiDey
(
83
points)

25
views
theoryofcomputation
contextfreelanguage
regularlanguages
0
votes
0
answers
14
RL and DCFL
the answer is given that the statement 2 is correct? But how… even if we create a DCFL by final state condition like : q(b,z0 z0)→ final state ,q(null,az0) → final state [Thats what was mentioned in the video solution] it will accept the string aab
asked
Jan 22
in
Theory of Computation
by
Nandkishor3939
Active
(
1.2k
points)

18
views
theoryofcomputation
regularlanguages
dcfl
0
votes
1
answer
15
Regular Languages
Is this language regular? If yes, how? L = {wxwR  x, w ϵ {0, 1}*} wR is reverse of string w. Thank you!
asked
Jan 22
in
Theory of Computation
by
Abhipsa Mishra
(
149
points)

62
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
1
answer
16
Practice Question
How to prove that $ (a+b)^*ab(a+b)^*+b^*a^* = (a+b)^*$
asked
Jan 14
in
Theory of Computation
by
Hardik Maheshwari
(
113
points)

53
views
theoryofcomputation
regularexpressions
regularlanguages
regulargrammar
0
votes
0
answers
17
MadeEasy Test Series: Theory of Computation Indentify Class Language
$L^{*}\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language)
asked
Jan 13
in
Theory of Computation
by
CS.user
(
97
points)

70
views
regularlanguages
theoryofcomputation
madeeasytestseries
madeeasytestseries2019
0
votes
0
answers
18
MadeEasy Subject Test 2019: Theory of Computation  Regular Expressions
Which of the following RE are equivalent ? (a+b)*abb(a+b)* (a+b)*a(a+b)*bb(a+b)* (a+b)*ab(a+b)*b(a+b)*
asked
Jan 13
in
Theory of Computation
by
Shamim Ahmed
Active
(
2.3k
points)

39
views
regularlanguages
theoryofcomputation
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
19
theory of autometa
let M be a finite autometa .let M' denote the machine obtained by interchanging the final and non final state L(M) U L(M') =sigma* L(M) $\cap$ L(M') =$\Phi$ how many statement is true and answer is both are true . no need to read the ... have to make non final state to final state and final to non final and no other change now the the correct image is so both statement is true
asked
Jan 11
in
Theory of Computation
by
Gurdeep Saini
Loyal
(
9k
points)

54
views
finiteautomata
theoryofcomputation
regularlanguages
regularexpressions
easy
0
votes
0
answers
20
MadeEasy Test Series: Theory Of Computation  Closure Property
L1 is regular, L2 and L3 are CFL L1 is regular, L2 is CFL and L3 is CSL L1 is CFL but not regular,L2 is CSL but not CFL,L3 is CFL L1, L2 and L3 are CFL
asked
Jan 9
in
Theory of Computation
by
Sambhrant Maurya
Active
(
1.5k
points)

49
views
madeeasytestseries
regularlanguages
contextfreelanguage
closureproperty
0
votes
0
answers
21
MadeEasy Test Series: Theory Of Computation  Regular Languages
asked
Jan 9
in
Theory of Computation
by
Sambhrant Maurya
Active
(
1.5k
points)

74
views
madeeasytestseries
regularlanguages
regularexpressions
0
votes
0
answers
22
Regular Language
Which of the following option is correct regarding dependability? A. Given a regular language R and contextfree C. Is every string in R also in C, i.e., Is L(R)⊆L(C) decidable? B. Given a regular language R and contextfree C. Is every string in C also in R, i.e., Is L(C)⊆L(R) decidable? C. Both (A) and (B) D. None of these
asked
Jan 7
in
Theory of Computation
by
Shivangi Parashar 2
(
361
points)

24
views
theoryofcomputation
regularlanguages
0
votes
0
answers
23
Regular Language
If L ≠ ∅ and L is regular then L is the union of regular language A1, . . . , An where each Ai is accepted by a DFA with exactly one final state .Please elaborate how this statement is true.
asked
Jan 7
in
Theory of Computation
by
Shivangi Parashar 2
(
361
points)

31
views
theoryofcomputation
regularlanguages
0
votes
1
answer
24
MadeEasy Subject Test 2019: Theory Of Computation  Regular Languages
Can anyone explain how S2 is false,I did not understand their logic.
asked
Jan 1
in
Theory of Computation
by
sripo
Active
(
1.5k
points)

74
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
expression
madeeasytestseries
0
votes
1
answer
25
regular language
Stare true and false Is this regular ? now if it is not regular then i want to change in the question in place of (a+b)+ if it is (a+b)* then ??
asked
Dec 31, 2018
in
Theory of Computation
by
Gurdeep Saini
Loyal
(
9k
points)

57
views
theoryofcomputation
regularlanguages
regularexpressions
+1
vote
2
answers
26
NTA NET DEC 2018
asked
Dec 30, 2018
in
Theory of Computation
by
rakeshcoresoft
(
227
points)

133
views
regularlanguages
regularexpressions
+1
vote
1
answer
27
Closure Properties
What is difference between Σ* and L* ? Which is true ? S1 : Σ* – {ϵ} = Σ+ S2 : L* – {ϵ} = L+ .
asked
Dec 24, 2018
in
Theory of Computation
by
anurag sharma
(
223
points)

162
views
theoryofcomputation
closureproperty
regularlanguages
0
votes
2
answers
28
#TOC Regular Language Is this a regular set?
WXW^R where W,X belongs to (0,1)* W^R is reverse of a string!
asked
Dec 22, 2018
in
Theory of Computation
by
iarnav
Loyal
(
9.6k
points)

74
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
0
votes
0
answers
29
UGC NET Doubt
https://gateoverflow.in/13365/ugcnetdec2014iii24 i’ve a small doubt in the solution of this question how is (a+b)*ba(a+b)* complement of the given language?
asked
Dec 14, 2018
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

59
views
ugc
regularlanguages
regulargrammar
0
votes
1
answer
30
UGC NET 2016
Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has _____ equivalence classes. pls give a detailed solution
asked
Dec 14, 2018
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

67
views
#dfa
finiteautomata
equivalenceclasses
regularlanguages
regularexpressions
Page:
1
2
3
4
5
6
...
15
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
GATE 2019 My reasoned routine. (AIR 558)
if i can you also can
M.S admissions help
Thank you #GO
GATE CSE 2019 Admissions Part 2  Score Change, COAP and Internal Sliding
Follow @csegate
Recent questions tagged regularlanguages
Recent Blog Comments
"Gate is not a 100 m race...
The sensible ones, usually dont...
The sensible ones, usually dont do the shona janu...
Congratulations brother :)...
It might seem that I am kidding, but honestly,...
48,243
questions
52,720
answers
183,287
comments
68,191
users