The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 regularlanguages
0
votes
0
answers
1
Peter Linz Edition 4 Exercise 3.2 Question 2 (Page No. 87)
Find an nfa that accepts the complement of the language in $L (ab^*aa + bba^*ab)$.
asked
Apr 2, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

8
views
peterlinz
peterlinzedition4
theoryofcomputation
regularexpressions
regularlanguages
0
votes
0
answers
2
Peter Linz Edition 4 Exercise 3.2 Question 1 (Page No. 87)
Find an nfa that accepts the language $L (ab^*aa + bba^*ab)$.
asked
Apr 2, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

13
views
peterlinz
peterlinzedition4
theoryofcomputation
regularexpressions
regularlanguages
0
votes
0
answers
3
Peter Linz Edition 4 Exercise 3.1 Question 13 (Page No. 76)
Find a regular expression for $L =$ {$vwv: v, w ∈${$a, b$}$^*, v =2$}.
asked
Mar 31, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

13
views
peterlinz
peterlinzedition4
regularexpressions
theoryofcomputation
regularlanguages
0
votes
0
answers
4
Peter Linz Edition 4 Exercise 3.1 Question 12 (Page No. 76)
Find a regular expression for the complement of the language in $L (r) =$ {$a^{2n}b^{2m+1}: n ≥ 0, m ≥ 0$}.
asked
Mar 31, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

10
views
peterlinz
peterlinzedition4
regularexpressions
theoryofcomputation
regularlanguages
0
votes
0
answers
5
Peter Linz Edition 4 Exercise 2.3 Question 12 (Page No. 62)
Show that if $L$ is regular, so is $L^R$.
asked
Mar 30, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

17
views
peterlinz
peterlinzedition4
theoryofcomputation
finiteautomata
regularlanguages
0
votes
0
answers
6
Peter Linz Edition 4 Exercise 2.3 Question 11 (Page No. 62)
Prove that all finite languages are regular.
asked
Mar 30, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

16
views
peterlinz
peterlinzedition4
theoryofcomputation
finiteautomata
regularlanguages
0
votes
1
answer
7
Peter Linz Edition 4 Exercise 2.1 Question 22 (Page No. 49)
Let, $L$= {$awa: w ∈ $ {$a,b$}* }. Show that $L$* is regular.
asked
Mar 22, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

59
views
peterlinz
peterlinzedition4
theoryofcomputation
finiteautomata
regularlanguages
+1
vote
1
answer
8
Peter Linz Edition 4 Exercise 2.1 Question 18 (Page No. 48)
Show that if $L$ is regular, so is $L$ $∪$ {$a$}, for all $a∈Σ$.
asked
Mar 20, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

37
views
peterlinz
peterlinzedition4
theoryofcomputation
finiteautomata
regularlanguages
+1
vote
2
answers
9
Peter Linz Edition 4 Exercise 2.1 Question 17 (Page No. 48)
Show that if $L$ is regular, so is $L $ {$λ$} .
asked
Mar 20, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

45
views
peterlinz
peterlinzedition4
theoryofcomputation
finiteautomata
regularlanguages
0
votes
0
answers
10
Peter Linz Edition 4 Exercise 2.1 Question 16 (Page No. 48)
Show that the set of all real numbers in $C$ is a regular language.
asked
Mar 20, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

74
views
peterlinz
peterlinzedition4
theoryofcomputation
finiteautomata
regularlanguages
0
votes
0
answers
11
Peter Linz Edition 4 Exercise 2.1 Question 15 (Page No. 48)
Show that the language $L =$ {$a^n: n$ is a multiple of $3$, but not a multiple of $5$} is regular.
asked
Mar 20, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

29
views
peterlinz
peterlinzedition4
theoryofcomputation
finiteautomata
regularlanguages
0
votes
1
answer
12
Peter Linz Edition 4 Exercise 2.1 Question 14 (Page No. 48)
Show that the language L= {$a^n: n$ is either a multiple of $3$ or a multiple of $5$} is regular.
asked
Mar 20, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

32
views
peterlinz
peterlinzedition4
theoryofcomputation
finiteautomata
regularlanguages
+1
vote
1
answer
13
Peter Linz Edition 4 Exercise 2.1 Question 13 (Page No. 48)
Show that the language $L= $ {$a^n: n ≥ 0,n ≠ 4$} is regular.
asked
Mar 20, 2019
in
Theory of Computation
by
Naveen Kumar 3
Boss

36
views
peterlinz
peterlinzedition4
theoryofcomputation
finiteautomata
regularlanguages
0
votes
0
answers
14
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
Mar 17, 2019
in
Theory of Computation
by
aditi19
Loyal

55
views
virtualgate
testseries
theoryofcomputation
regularlanguages
regularexpressions
0
votes
1
answer
15
Peter Linz Edition 4 Exercise 4.3 Question 6 (Page No. 122)
Given $L_1=${$a^nb^n$$n\geqslant 1$} , $L_2=${$a^nb^mn\geq 1, m\geq 1$}, $L_3=${$a^nb^{n+2}n\geqslant 1$} if $L_1 \cup L_2$ is regular then why $L_1 \cup L_3$ is not regular? also what is the language of $L_1 \cup L_3$?
asked
Feb 25, 2019
in
Theory of Computation
by
aditi19
Loyal

224
views
theoryofcomputation
peterlinz
peterlinzedition4
regularlanguages
pumpinglemma
+1
vote
1
answer
16
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, 2019
in
Theory of Computation
by
aditi19
Loyal

209
views
theoryofcomputation
peterlinz
peterlinzedition4
finiteautomata
regularlanguages
regularexpressions
regulargrammar
+1
vote
0
answers
17
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, 2019
in
Theory of Computation
by
aditi19
Loyal

72
views
theoryofcomputation
peterlinz
peterlinzedition4
finiteautomata
regularlanguages
regulargrammar
+1
vote
1
answer
18
Peter Linz Edition 4 Exercise 3.2 Question 10.b (Page No. 88)
What is the regular expression for this
asked
Feb 22, 2019
in
Theory of Computation
by
aditi19
Loyal

217
views
theoryofcomputation
peterlinz
peterlinzedition4
finiteautomata
regularlanguages
regularexpressions
+13
votes
4
answers
19
GATE20197
If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular? $L.L^R = \{xy \mid x \in L , y^R \in L\}$ $\{ww^R \mid w \in L \}$ $\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* $such that$ \ xy \in L\}$ $\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* $such that$ \ xy \in L\}$
asked
Feb 7, 2019
in
Theory of Computation
by
Arjun
Veteran

3.5k
views
gate2019
theoryofcomputation
regularlanguages
0
votes
1
answer
20
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, 2019
in
Theory of Computation
by
Harsh Kumar
Active

92
views
madeeasytestseries
theoryofcomputation
regularlanguages
0
votes
1
answer
21
MadeEasy Test Series 2019: Thoery of Computation  Regular Languages
Is the following language regular or not?
asked
Jan 25, 2019
in
Theory of Computation
by
Anu Sreenivasan Unni

156
views
theoryofcomputation
regularlanguages
madeeasytestseries2019
madeeasytestseries
+2
votes
0
answers
22
AAI Mock 4  TOC
Which of the following are regular languages?
asked
Jan 23, 2019
in
Theory of Computation
by
muthu kumar
Active

67
views
regularlanguages
finiteautomata
theoryofcomputation
0
votes
2
answers
23
language
ϕ Σ* L X
asked
Jan 22, 2019
in
Theory of Computation
by
Rahul_Rathod_

113
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
contextfreelanguages
0
votes
0
answers
24
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, 2019
in
Theory of Computation
by
saptarshiDey

118
views
theoryofcomputation
contextfreelanguages
regularlanguages
0
votes
0
answers
25
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, 2019
in
Theory of Computation
by
Nandkishor3939
Active

46
views
theoryofcomputation
regularlanguages
dcfl
0
votes
1
answer
26
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, 2019
in
Theory of Computation
by
Abhipsa

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

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

113
views
regularlanguages
theoryofcomputation
madeeasytestseries
madeeasytestseries2019
0
votes
0
answers
29
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, 2019
in
Theory of Computation
by
Shamim Ahmed
Active

112
views
regularlanguages
theoryofcomputation
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
30
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, 2019
in
Theory of Computation
by
Gurdeep Saini
Boss

73
views
finiteautomata
theoryofcomputation
regularlanguages
regularexpressions
easy
Amazon.in Widgets
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
20
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
IIT gandhinagar mtech cse2020
IIT Delhi Research Interview Shortlists out
IIT Gandhinagar interview experience
IIT Gandhinagar Interview 2020
DRDO Scientist B recruitment Notification
Subjects
All categories
General Aptitude
(1.9k)
Engineering Mathematics
(8.1k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.1k)
Others
(1.6k)
Admissions
(595)
Exam Queries
(573)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(18)
Unknown Category
(1k)
Recent questions tagged regularlanguages
Recent Blog Comments
Another few, 1. Chrome warns about loading...
I secured 89 out of 216 and not selected. So what...
There was silence for 30 secs after I told...
What is Your Score ...???
which is the book you purchased for previous year...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
52,223
questions
59,811
answers
201,020
comments
118,086
users