The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Recent questions tagged regularlanguages
0
votes
1
answer
1
regular grammar
What will be regular grammar for given regular expression $r=(ab^*+b)^*ab$
asked
Mar 27
in
Theory of Computation
by
saurabh rai
Boss
(
12.2k
points)

39
views
theoryofcomputation
regulargrammar
regularlanguages
0
votes
2
answers
2
TOC Problem
asked
Mar 23
in
Theory of Computation
by
pankaj_vir
Loyal
(
6.3k
points)

72
views
theoryofcomputation
regularlanguages
contextfreelanguages
0
votes
1
answer
3
Testbook_TOC
asked
Mar 23
in
Theory of Computation
by
pankaj_vir
Loyal
(
6.3k
points)

63
views
theoryofcomputation
regularlanguages
0
votes
2
answers
4
Peter Linz Exercise 4.3.11
Show that the language $L =$$\left \{ a^{n!} : n\geq 1 \right \}$ is not regular using pumping lemma
asked
Mar 20
in
Theory of Computation
by
Mk Utkarsh
Boss
(
11.9k
points)

96
views
theoryofcomputation
peterlinz
regularlanguages
+1
vote
2
answers
5
True / False (Regular Languages)
$L_{1} L_{2}$ is regular if and only if $L_{1}$ and $L_{2}$ both are regular If $L_{1}\cup L_{2}$ is regular and $L_{2}$ is finite then $L_{1}$ is regular If $L_{1}\cap L_{2}$ is regular then $L_{2}$ and $L_{1}$ may or may not be regular If $L_{1}$$L_{2}$ is regular then $L_{2}$ and $L_{1}$ are regular
asked
Mar 17
in
Theory of Computation
by
Mk Utkarsh
Boss
(
11.9k
points)

56
views
theoryofcomputation
regularlanguages
0
votes
2
answers
6
Peter linz Exercise 3.1 Question 16.3
Give regular expression for the following language on $\sum = \left \{ a,b,c \right \}$ All strings that contain at least one occurrence of each symbol in $\sum$
asked
Mar 14
in
Theory of Computation
by
Mk Utkarsh
Boss
(
11.9k
points)

57
views
theoryofcomputation
peterlinz
regularlanguages
regularexpressions
+1
vote
1
answer
7
Peter Linz Exercise 3.1 Question 9
Give a regular expression for $L^{R}$ L = $(a+bc)^{*}(c+\phi)$
asked
Mar 14
in
Theory of Computation
by
Mk Utkarsh
Boss
(
11.9k
points)

48
views
theoryofcomputation
regularlanguages
peterlinz
+1
vote
1
answer
8
Automata
If $L1$ is regular language and $L2$ is unknown language then what can we say about $L1L2$. Will it be regular or not? I think it will be regular because even if $L2$ is not regular then still (Regular  not Regular) will result in Regular, according to the properties of set ... from The given set will not change the set. I want to know if I am right and if I am not then what's the error?
asked
Mar 10
in
Theory of Computation
by
hrcule
(
113
points)

45
views
theoryofcomputation
regularlanguages
finiteautomata
+1
vote
0
answers
9
Regular Expression
What is the regular expression of $L = \{ s \in L$ $i$ = no of $1$ in string $s$ $j$ = no of $0$ in string $s$ $i+j$ is odd $\}$ ???
asked
Mar 4
in
Theory of Computation
by
Dharmesh Gusai
(
17
points)

64
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
0
votes
1
answer
10
Finding whether given languages are regular or context free
asked
Mar 2
in
Theory of Computation
by
GateAspirant999
Active
(
2.5k
points)

45
views
regularlanguages
contextfreelanguage
+1
vote
1
answer
11
Language of left, right, top and down steps
asked
Mar 2
in
Theory of Computation
by
GateAspirant999
Active
(
2.5k
points)

24
views
testseries
regularlanguages
contextfreelanguages
theoryofcomputation
+2
votes
1
answer
12
Regular language Prefix
Given FSA for language L, how to find FSA that accepts all prefixes of L? Acc to below mentioned link "We can construct a DFA to decide Prefix(L) by taking the DFA for L and marking all states from which an accept state is reachable ... states from which an accept state is reachable as accept states, then eventually all states would turn to final states.Am I right?
asked
Mar 2
in
Theory of Computation
by
Mamta Satywali
Active
(
2.2k
points)

46
views
theoryofcomputation
regularlanguages
finiteautomata
+1
vote
2
answers
13
Regular Expressions
L1={anbm:n>=3,m<=4} Find complement of L1
asked
Feb 14
in
Theory of Computation
by
Ahsanul Hoque
(
163
points)

82
views
regularlanguages
theoryofcomputation
+2
votes
1
answer
14
Regular Language
Let $L\mid$ be a regular language and $L_1 = \{x\mid\text{there exist y}\mid \text{so that xy} \in L \text{ and} \mid x \mid = 2 \mid y\mid \mid \}$ $L_2 = \{x\mid\text{there exist y}\mid \text{so that yx} \in L \text{ and} \mid x ... is regular but $L_2$ is not. $L_2$ is regular but $L_1$ is not. Both $L_1$ and $L_2$ are regular. Both $L_1$ and $L_2$ are not regular.
asked
Feb 2
in
Theory of Computation
by
vijay_jr
Active
(
1.1k
points)

69
views
theoryofcomputation
regularlanguages
finiteautomata
+1
vote
0
answers
15
#Practise Class of Languages
$xwxw^r \ w,x \in (a,b)^*$ $wxw^{r}x \ w,x \in (a,b)^*$
asked
Jan 31
in
Theory of Computation
by
Anjan
Active
(
1.7k
points)

33
views
theoryofcomputation
regularlanguages
0
votes
1
answer
16
Regular Languages
Language {w  ww=www} is regular. How and what is this language?
asked
Jan 31
in
Theory of Computation
by
gauravkc
Active
(
4.9k
points)

41
views
theoryofcomputation
regularlanguages
+1
vote
0
answers
17
Regular  Context Free?
Let L be a given contextfree language over the alphabet {a, b}. Construct L1, L2 as follows. Let L1 = L − {xyx  x, y ∈ {a, b}∗}, and L2 = L·L. Then, (A) Both L1 and L2 are regular. B) Both L1 and L2 are context free but not necessarily regular. (C) L1 is regular and L2 is context free. (D) L1 and L2 both may not be context free
asked
Jan 30
in
Theory of Computation
by
Tuhin Dutta
Loyal
(
7.6k
points)

60
views
theoryofcomputation
contextfreelanguage
regularlanguages
+2
votes
1
answer
18
Made easy test
(a^n)^m b^n where n>=0 and m>1 is a) regular b) cfl c) csl d) none
asked
Jan 29
in
Theory of Computation
by
♥_Less
Junior
(
957
points)

68
views
madeeasytestseries
regularexpressions
regularlanguages
contextfreelanguage
contextsensitive
+1
vote
0
answers
19
Made Easy test series
a) Only L1 is correct b)Only L2 is correct c)Both L1 and L2 are correct d)None of L1 and L2 is correct My question is: What is meant by prefix of string? And how is L1 regular?
asked
Jan 22
in
Theory of Computation
by
Sumaiya23
Active
(
1.3k
points)

43
views
madeeasytestseries
theoryofcomputation
regularlanguages
+3
votes
2
answers
20
TOC DFA
I got 3 states... Given is 4
asked
Jan 16
in
Theory of Computation
by
Ashwin Kulkarni
Boss
(
17.5k
points)

73
views
theoryofcomputation
regularlanguages
contextfreelanguage
+2
votes
1
answer
21
regular expressions
Answer is c. but i think it should be b as r1 = (0+1)* = r2=r3. please correct me if i m wrong
asked
Jan 11
in
Theory of Computation
by
amIndian
(
71
points)

87
views
theoryofcomputation
regularexpressions
regularlanguages
finiteautomata
+1
vote
2
answers
22
Self oubt
Are the languages produced (a+b)* and (a*b*)* same?
asked
Jan 10
in
Theory of Computation
by
ankit_thawal
Active
(
2.1k
points)

29
views
regularlanguages
+1
vote
0
answers
23
regular language
Is there any difference bw L3 and L31
asked
Jan 8
in
Theory of Computation
by
Pawan Kumar 2
Active
(
4.4k
points)

44
views
regularlanguages
+2
votes
1
answer
24
Context Free Language
Is B context free? Please explain in detail.
asked
Jan 6
in
Theory of Computation
by
Shubham Kumar Gupta
Junior
(
513
points)

158
views
contextfreelanguage
theoryofcomputation
identifyclasslanguage
regularlanguages
grammar
+1
vote
0
answers
25
TOC Regular Language
Which of the following languages over the alphabet A = {0, 1} is regular? 1. {w ε A* : Ǝu ε A* such that w = uu} 2. {w ε A* : w does not contain any 1’s in even positions, where the leftmost is position 1} 3. {w ε A* : w contains a 1 in every position that is a power of 2}
asked
Jan 5
in
Theory of Computation
by
Harish Karnam
Active
(
1.2k
points)

49
views
theoryofcomputation
regularlanguages
+1
vote
1
answer
26
Regular expressions
asked
Jan 1
in
Theory of Computation
by
Aakanchha
Junior
(
663
points)

78
views
theoryofcomputation
regularexpressions
regularlanguages
#theoryofcomputation
+4
votes
0
answers
27
Find Regular
Which one is Regular? 1)$L_{1}=\left \{ a^{x}b^{y}c^{z}  \left ( x=y\vee y=z \right ) \wedge x+y+z\leq 100\right \}$ 2)$L_{2}=\left \{ a^{x}b^{y}c^{z}  \left ( x=y\vee y=z \right ) \wedge x+y+z\geq 100\right \}$
asked
Dec 30, 2017
in
Theory of Computation
by
srestha
Veteran
(
81.9k
points)

58
views
theoryofcomputation
regularlanguages
+1
vote
1
answer
28
closure property
CFL over a single alphabet are always> A. dcfl B. regular C. dcfl but not regular d. non regular
asked
Dec 30, 2017
in
Theory of Computation
by
raviyogi
Active
(
2.5k
points)

64
views
theoryofcomputation
contextfreelanguage
closureproperty
regularlanguages
+1
vote
0
answers
29
Regular Expression
Let say we have given 10 Regular Expression and we need to check which of them is pointing to the same Regular Language. Then which one of the following is best method Brute Force method (Take some string and cross verify it) Create Minimal dfa for them Using intuition You are trying to observe the language pattern
asked
Dec 23, 2017
in
Theory of Computation
by
hacker16
Active
(
2.6k
points)

75
views
regularexpressions
theoryofcomputation
regularlanguages
0
votes
0
answers
30
Regular Expression
L1 = (a + b)* b (a+b)* L2 = a* b (a+b)* L3 = (a+b)* ba* Explain L1 = L2 = L3 ?
asked
Dec 23, 2017
in
Theory of Computation
by
hacker16
Active
(
2.6k
points)

81
views
theoryofcomputation
regularexpressions
regularlanguages
Page:
1
2
3
4
5
6
...
11
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
OS resources
All the Best to ISRO SC WRitten Test candidates
About new iits
barc result
Suggestion for IIITH exam
Follow @csegate
Gatecse
Recent questions tagged regularlanguages
Recent Blog Comments
Thank you, Sir!
@
Question 1 and 2 of sample paper section 2 were ...
Direct questions from sample paper?That's ...
Not only GATE, they even gave questions from the ...
34,816
questions
41,803
answers
119,041
comments
41,445
users