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. For hardcopy of previous year questions please see
here
Recent questions tagged regulargrammar
0
votes
0
answers
1
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
3 days
ago
in
Theory of Computation
by
GATEBOOK
Active
(
1.7k
points)

9
views
gb2019toc1
regulargrammar
0
votes
1
answer
2
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
in
Theory of Computation
by
sripo
Junior
(
717
points)

22
views
theoryofcomputation
regularlanguages
regulargrammar
0
votes
0
answers
3
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
in
Theory of Computation
by
sripo
Junior
(
717
points)

33
views
theoryofcomputation
finiteautomata
regulargrammar
numberofdfa
minimalstateautomata
0
votes
0
answers
4
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
in
Theory of Computation
by
Ananya Jaiswal 1
Active
(
1.9k
points)

24
views
theoryofcomputation
regulargrammar
0
votes
0
answers
5
conversion of right linear grammar to DFA
asked
Sep 16
in
Theory of Computation
by
sushmita
Boss
(
15k
points)

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

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

48
views
theoryofcomputation
regulargrammar
+1
vote
3
answers
8
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 regular ... 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
in
Theory of Computation
by
Sourav_35
(
201
points)

106
views
regulargrammar
theoryofcomputation
finiteautomata
0
votes
1
answer
9
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.4k
points)

61
views
theoryofcomputation
regulargrammar
regularlanguages
0
votes
0
answers
10
#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
in
Theory of Computation
by
iarnav
Loyal
(
8.9k
points)

55
views
theoryofcomputation
finiteautomata
regularexpressions
regulargrammar
+1
vote
0
answers
11
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
in
Theory of Computation
by
smriti bhati
(
55
points)

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

80
views
theoryofcomputation
normal
regulargrammar
0
votes
1
answer
13
#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
Junior
(
979
points)

80
views
theoryofcomputation
finiteautomata
regulargrammar
0
votes
1
answer
14
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
(
785
points)

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

227
views
theoryofcomputation
finiteautomata
regulargrammar
+5
votes
2
answers
16
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
(
465
points)

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

49
views
regulargrammar
theoryofcomputation
+1
vote
1
answer
18
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
(
8.9k
points)

156
views
theoryofcomputation
regulargrammar
0
votes
0
answers
19
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.3k
points)

111
views
regulargrammar
theoryofcomputation
+1
vote
0
answers
20
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
Junior
(
999
points)

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

35
views
regulargrammar
+2
votes
1
answer
22
Peter Linz toc chapter 3 ex3.3 question 13b(page no 97)
asked
Aug 16, 2017
in
Theory of Computation
by
Satyajeet Singh
Active
(
1.9k
points)

246
views
theoryofcomputation
regulargrammar
finiteautomata
+1
vote
1
answer
23
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
(
25.4k
points)

56
views
theoryofcomputation
regulargrammar
+3
votes
1
answer
24
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
(
25.4k
points)

276
views
regularexpressions
theoryofcomputation
regulargrammar
+1
vote
2
answers
25
Regular grammar form
Regular grammar can be of form : A>tV or A>Vt or A>t where t is terminal and V is variable. Here is t string of terminals or a single terminal? I am seeing different definitions of terminal everywhere.
asked
Jul 12, 2017
in
Theory of Computation
by
Xylene
Active
(
3.9k
points)

78
views
theoryofcomputation
regulargrammar
+1
vote
1
answer
26
Regular Language to Regular Grammar
I think the below language is Regular L = {xy  na(x) = nb(y) where x,y $\in$ (a,b)* } Doubt : Since if we consider any string in given language is split in such a way so that we satisfy the required condition. like (abbbaa)(bbaba), (bbbbb)(a) etc. (Note  brackets are just for understanding purpose). Can some one write the regular grammar for this language?
asked
Jul 6, 2017
in
Theory of Computation
by
Shubhanshu
Boss
(
16.2k
points)

123
views
theoryofcomputation
regularlanguages
regulargrammar
+1
vote
3
answers
27
Peter Linz Exercise
Regular Expression: Q1) What languages do the expression (∅*)* and a∅ denote? Q2) Find a regular expression and finite automata for all bit strings, with leading bit 1 interpreted as a binary integer, with values not between 10 and 30. Regular Grammar: Q1) Suggest a construction by which a ... the language L = { w ∈ {a, b}* / (number of a in w + 3*number of b) in w is even }
asked
Jul 5, 2017
in
Theory of Computation
by
Shubhanshu
Boss
(
16.2k
points)

410
views
theoryofcomputation
regularlanguages
regularexpressions
regulargrammar
peterlinz
+11
votes
2
answers
28
GATE199015a
Is the language generated by the grammer $G$ regular? If so, give a regular expression for it, else prove otherwise G: $S \rightarrow aB$ $B \rightarrow bC$ $C \rightarrow xB$ $C \rightarrow c$
asked
Nov 26, 2016
in
Theory of Computation
by
makhdoom ghaya
Boss
(
40.4k
points)

584
views
gate1990
descriptive
theoryofcomputation
regularlanguages
regulargrammar
grammar
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
Basic LaTeX guide
IIT Madras Phd
Databases GO Classroom
Happy Birthday Sir Arjun
NIELIT EXAM DATE 2018
Follow @csegate
Gatecse
Recent questions tagged regulargrammar
Recent Blog Comments
No issue, and quicklatex is useful.
Oh, I didn't notice that post. Should I let this...
A bit more specific guide for GO can be found...
You can give the solution  most of the...
belated happist birthday Arjun sir .
42,415
questions
48,473
answers
154,470
comments
62,884
users