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 regulargrammar
0
votes
1
answer
1
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
(
97
points)

29
views
theoryofcomputation
regularexpressions
regularlanguages
regulargrammar
0
votes
0
answers
2
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.2k
points)

55
views
ugc
regularlanguages
regulargrammar
0
votes
0
answers
3
Self doubt about relation between regular and linear grammar
If a grammar G is both left linear as well as right linear then,what should be the case a) G is always not regular b) G may or may not be regular c) something else
asked
Nov 30, 2018
in
Theory of Computation
by
Abbas Ahmad
(
71
points)

26
views
theoryofcomputation
regulargrammar
finiteautomata
0
votes
1
answer
4
GATEBOOK2019TOC113
Which of the following grammar is a regular grammar and generates the same language as the regular expression $a^*+b^*+ ab?$ $S\to AB,\:A\to aA \mid \epsilon;\:B\to bB\mid \epsilon$ $S\to ab \mid A \mid B; \: A\to Aa \mid a;\: B\to Bb \mid b$ $S\to ab \mid A \mid B; \: A\to aA \mid \epsilon;\: B\to bB \mid \epsilon$ $S\to A\mid B;\: A\to aA \mid b;\: B\to Bb \mid b$
asked
Nov 12, 2018
in
Theory of Computation
by
GATEBOOK
Boss
(
13.9k
points)

56
views
gb2019toc1
regulargrammar
0
votes
1
answer
5
Are these two languages equal?
L1=ab* L2=a(aa)*b(bb)* Are the languages equal if not what relation do they satisfy?
asked
Nov 6, 2018
in
Theory of Computation
by
sripo
Active
(
1.3k
points)

33
views
theoryofcomputation
regularlanguages
regulargrammar
0
votes
0
answers
6
This question is taken from a sample paper
Consider the following grammar G. Is this regular? S →EF E → a∈ F → abFac
asked
Nov 3, 2018
in
Theory of Computation
by
Piyush Agarwal 1
(
15
points)

15
views
finiteautomata
regularlanguages
regulargrammar
0
votes
1
answer
7
I came across this in a test paper
Consider the following grammar G. Is this regular? S →EF E → a∈ F → abFac
asked
Nov 3, 2018
in
Theory of Computation
by
Piyush Agarwal 1
(
15
points)

14
views
regulargrammar
regularlanguages
finiteautomata
0
votes
0
answers
8
Grammar to DFA Construction
For the given Grammar S>aAbB A>bCaS B>aCbS C>aBbA Construct DFA I am getting confused in understanding how to take the final state.
asked
Oct 13, 2018
in
Theory of Computation
by
sripo
Active
(
1.3k
points)

47
views
theoryofcomputation
finiteautomata
regulargrammar
numberofdfa
minimalstateautomata
0
votes
0
answers
9
regular grammar
If a is a terminal and S, A, B are three nonterminals, then which of the following are regular grammars? (a) S → ε, A → aSb (b) A → aBa, B → bAb (c) A → BaBab (d) A → abBaB answer given is b. but I think all are regular grammars. please clear my doubt.
asked
Sep 29, 2018
in
Theory of Computation
by
Ananya Jaiswal 1
Active
(
2.2k
points)

29
views
theoryofcomputation
regulargrammar
0
votes
1
answer
10
conversion of right linear grammar to DFA
In converting right linear regular grammar to DFA how to determine the final states? Can anyone tell the procedure?
asked
Sep 16, 2018
in
Theory of Computation
by
sushmita
Boss
(
16.6k
points)

54
views
theoryofcomputation
finiteautomata
regulargrammar
nfa
0
votes
1
answer
11
Regular Grammar
Is there any difference between Type 3 grammar and regular grammar?
asked
Jul 5, 2018
in
Theory of Computation
by
Gaurav Parashar
(
177
points)

56
views
regulargrammar
theoryofcomputation
compilerdesign
0
votes
1
answer
12
self doubt
What is the differene between { Φ } and λ and what happens when we concatenate this with a regular language ??
asked
Apr 25, 2018
in
Theory of Computation
by
ankit aingh
(
175
points)

50
views
theoryofcomputation
regulargrammar
+1
vote
3
answers
13
Regular Grammars
$S\rightarrow AB$ $A\rightarrow a$ $B\rightarrow b$ The language generated by the above grammar is ab and since we can give a FA for the language then it must be a regular language.Now,since the given grammar generates a regular language then it must be a ... grammar but again it is not in the form of TYPE 3 or regular grammar,then how to identify if the grammar is regular or not?
asked
Apr 6, 2018
in
Theory of Computation
by
Sourav_35
(
201
points)

138
views
regulargrammar
theoryofcomputation
finiteautomata
0
votes
1
answer
14
regular grammar
What will be regular grammar for given regular expression $r=(ab^*+b)^*ab$
asked
Mar 27, 2018
in
Theory of Computation
by
saurabh rai
Boss
(
12.5k
points)

64
views
theoryofcomputation
regulargrammar
regularlanguages
0
votes
0
answers
15
#TOC Doubt
L = anbm / n,m>=1 What type pf Language is this? Also, please tell are n,m are independent or dependent i.e can we have like n=2 and m=3 or both n,m have to have same values!?
asked
Jan 30, 2018
in
Theory of Computation
by
iarnav
Loyal
(
9.4k
points)

59
views
theoryofcomputation
finiteautomata
regularexpressions
regulargrammar
+1
vote
0
answers
16
Made easy Tests
What is the correct way to solve questions of this kind where equations like these are given and you are asked to determine what languages do the variables X1 X2 X3.. represent?
asked
Jan 26, 2018
in
Theory of Computation
by
smriti bhati
(
55
points)

47
views
madeeasytestseries
statediagram
theoryofcomputation
regulargrammar
+1
vote
0
answers
17
TOC Regular Grammar
asked
Dec 29, 2017
in
Theory of Computation
by
gauravkc
Loyal
(
7.2k
points)

86
views
theoryofcomputation
normal
regulargrammar
0
votes
1
answer
18
#TOC DOUBT
A)Is it useful to draw FA if we need to tell the language of the following grammar...? B)What is the language of the following grammar..? C) What will be the final state Of FA and what is the criteria to find out final state.if a given a regular grammar.? S→aBbA A→aSbAAa B→bSaBBb
asked
Dec 13, 2017
in
Theory of Computation
by
Sahil1994
Active
(
1k
points)

82
views
theoryofcomputation
finiteautomata
regulargrammar
+1
vote
1
answer
19
Regular Grammar
A regular grammar is always linear but not all linear grammar are regular. Please explain why this statement is true
asked
Dec 9, 2017
in
Compiler Design
by
Shivi rao
Junior
(
795
points)

54
views
regulargrammar
compilerdesign
+1
vote
2
answers
20
Need help to draw a DFA from a Right Linear grammar
.............................................................. .
asked
Nov 22, 2017
in
Theory of Computation
by
Tuhin Dutta
Loyal
(
8.8k
points)

281
views
theoryofcomputation
finiteautomata
regulargrammar
+5
votes
2
answers
21
REGULAR GRAMMARS
if a is a terminal and S, A, B are three nonterminals, then which of the following are regular grammars? (a) S → ε, A → aSb (b) A → aBa, B → bAb (c) A → BaBab (d) A → abBaB please explain how u proceed? The answer is given "b"
asked
Oct 1, 2017
in
Compiler Design
by
VIKRAM KASANA
Junior
(
517
points)

309
views
regulargrammar
compilerdesign
regularlanguages
0
votes
0
answers
22
Regular Grammar
https://gateoverflow.in/?qa=blob&qa_blobid=12864829104497909178
asked
Sep 19, 2017
in
Theory of Computation
by
LORD ofKINGS
(
47
points)

56
views
regulargrammar
theoryofcomputation
+1
vote
1
answer
23
TOC Question
Refer this Question  https://gateoverflow.in/46529/cmi2012a01 and someone please explain option b) and c) there's contradiction b/w the answers given there.
asked
Sep 5, 2017
in
Theory of Computation
by
iarnav
Loyal
(
9.4k
points)

175
views
theoryofcomputation
regulargrammar
0
votes
0
answers
24
Left linear regular grammar to machine
Can we directly convert a given Left linear regular grammar to machine ? or First convert Left linear regular grammar to Right linear regular grammar and then to machine . http://scanftree.com/automata/conversionofleftlineargrammartofiniteautomata
asked
Sep 5, 2017
in
Compiler Design
by
VS
Loyal
(
9.9k
points)

126
views
regulargrammar
theoryofcomputation
+1
vote
0
answers
25
Regular Grammar
According to the definition  "A grammar is regular if it is either left linear or right linear." Now, "Set of all strings over {a, b} starting with an 'a' and ending with a 'b'" represents a regular language. Regular Expression ... think that's possible as the language is regular) Or, are there any exceptions in rules of regular grammar? Please explain. Thanks!
asked
Sep 5, 2017
in
Theory of Computation
by
Akash Mishra
Active
(
1.1k
points)

62
views
regulargrammar
theoryofcomputation
regularlanguages
0
votes
0
answers
26
regular grammar
how to convert FA to Left linear regular grammar??
asked
Aug 29, 2017
in
Theory of Computation
by
Hira Thakur
Boss
(
13.8k
points)

38
views
regulargrammar
+2
votes
1
answer
27
Peter Linz toc chapter 3 ex3.3 question 13b(page no 97)
Find the regular grammar for the following languages on {a,b}. b) L={w: (na(w) nb(w))mod3=1} Here na is the no of 'a' in string w, nb is the no of 'b' in string b. Here is my solution. Is this answer correct? Any other approach or solution is also welcomed.
asked
Aug 16, 2017
in
Theory of Computation
by
Satyajeet Singh
Active
(
2k
points)

263
views
theoryofcomputation
regulargrammar
finiteautomata
+1
vote
1
answer
28
TOC Grammer equivalence
Which of the following grammars are equivalent?S is non terminal ,e is epsilon,a is terminal 1. S> aS e 2. S> aS  a e 3. S> aaS e
asked
Aug 6, 2017
in
Theory of Computation
by
rahul sharma 5
Boss
(
26.5k
points)

65
views
theoryofcomputation
regulargrammar
+3
votes
1
answer
29
TOC Linear grammer
As Type(3)/Regular grammars are form of left linear or right linear , Now suppose i have two grammars,G1 and G2 which are generating left linear and right linear grammars respectively.And now my new Grammar G : has one production as S>S1S2(where ... it has both left and right linear.But we also know that regular union is regular.So what can be concluded from this scenario ?
asked
Jul 31, 2017
in
Theory of Computation
by
rahul sharma 5
Boss
(
26.5k
points)

296
views
regularexpressions
theoryofcomputation
regulargrammar
Page:
1
2
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
question on digital electronics
PSU's
Decidability Slides
AAI JE IT results out! Adv no 02/2018
Graph Theory Slides for GATECSE
Follow @csegate
Gatecse
Recent questions tagged regulargrammar
Recent Blog Comments
love you sir and great work Subarna and...
18th jan was the last date
anyone from west bengal plss solve above query as...
in the home page of GO, the deadline for WBSEDCL...
47,108
questions
51,358
answers
177,863
comments
66,688
users