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
conversion of right linear grammar to DFA
asked
Sep 16
in
Theory of Computation
by
sushmita
Boss
(
13.9k
points)

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

49
views
regulargrammar
theoryofcomputation
compilerdesign
0
votes
1
answer
3
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)

44
views
theoryofcomputation
regulargrammar
+1
vote
3
answers
4
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)

72
views
regulargrammar
theoryofcomputation
finiteautomata
0
votes
1
answer
5
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.3k
points)

57
views
theoryofcomputation
regulargrammar
regularlanguages
0
votes
0
answers
6
#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.1k
points)

53
views
theoryofcomputation
finiteautomata
regularexpressions
regulargrammar
+1
vote
0
answers
7
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)

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

73
views
theoryofcomputation
normal
regulargrammar
0
votes
1
answer
9
#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)

79
views
theoryofcomputation
finiteautomata
regulargrammar
0
votes
1
answer
10
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
11
Need help to draw a DFA from a Right Linear grammar
asked
Nov 22, 2017
in
Theory of Computation
by
Tuhin Dutta
Loyal
(
8.1k
points)

198
views
theoryofcomputation
finiteautomata
regulargrammar
+5
votes
2
answers
12
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)

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

42
views
regulargrammar
theoryofcomputation
+1
vote
1
answer
14
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.1k
points)

136
views
theoryofcomputation
regulargrammar
0
votes
0
answers
15
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
(
9k
points)

100
views
regulargrammar
theoryofcomputation
+1
vote
0
answers
16
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)

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

35
views
regulargrammar
+2
votes
1
answer
18
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)

225
views
theoryofcomputation
regulargrammar
finiteautomata
+1
vote
1
answer
19
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
(
24.7k
points)

52
views
theoryofcomputation
regulargrammar
+3
votes
1
answer
20
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
(
24.7k
points)

261
views
regularexpressions
theoryofcomputation
regulargrammar
+1
vote
2
answers
21
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.8k
points)

72
views
theoryofcomputation
regulargrammar
+1
vote
1
answer
22
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
(
15.2k
points)

120
views
theoryofcomputation
regularlanguages
regulargrammar
+1
vote
3
answers
23
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
(
15.2k
points)

390
views
theoryofcomputation
regularlanguages
regularexpressions
regulargrammar
peterlinz
+11
votes
2
answers
24
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.2k
points)

553
views
gate1990
descriptive
theoryofcomputation
regularlanguages
regulargrammar
grammar
+6
votes
2
answers
25
Convert RE to Left Linear Grammer
How to convert a Regular Expression to Left Linear Grammar ? Eg : (0+1)*00(0+1)*
asked
Jul 23, 2016
in
Theory of Computation
by
pC
Boss
(
22.3k
points)

796
views
regularexpressions
regulargrammar
+1
vote
1
answer
26
UGCNETJune2014II10
The regular grammar for the language L= { $w\mid n_{a}$(w) and $n_{b} (w)$ are both even, $w \in \left\{a, b\right\}$ * } is given by : (Assume, $p, q, r$ and $s$ are states) $p \rightarrow aq \mid br \mid \lambda, q \rightarrow bs \ ... \rightarrow aq \mid br , q \rightarrow bs \mid ap r \rightarrow as \mid bp, s \rightarrow ar \mid bq$ $p$ is both initial and final states.
asked
Jun 24, 2016
in
Theory of Computation
by
makhdoom ghaya
Boss
(
40.2k
points)

580
views
ugcnetjune2014ii
theoryofcomputation
regulargrammar
+23
votes
4
answers
27
GATE2015235
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding nonterminals of a regular grammar. $X_0, X_1, \text{ and } X_2$ are related as follows. $X_0 = 1 X_1$ $X_1 = 0 X_1 + 1 X_2$ $X_2 = ... in $X_0$? $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$
asked
Feb 12, 2015
in
Theory of Computation
by
jothee
Veteran
(
101k
points)

3k
views
gate20152
theoryofcomputation
regulargrammar
normal
+17
votes
2
answers
28
GATE2006IT29
Consider the regular grammar below $S \rightarrow bS \mid aA \mid \epsilon $ $A \rightarrow aS \mid bA$ The MyhillNerode equivalence classes for the language generated by the grammar are $\{w \in (a + b)^* \mid \#a(w) \text{ is even) and} \{w \in (a + b)^* \mid \#a(w) \text{ is odd}\}$ ... \neq \#b(w)\}$ $\{\epsilon\},\{wa \mid w \in (a + b)^* \text{and} \{wb \mid w \in (a + b)^*\}$
asked
Oct 31, 2014
in
Theory of Computation
by
Ishrat Jahan
Boss
(
19.1k
points)

1.4k
views
gate2006it
theoryofcomputation
normal
regulargrammar
To see more, click for the
full list of questions
or
popular tags
.
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
Read/Unread questions
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Follow @csegate
Gatecse
Recent questions tagged regulargrammar
Recent Blog Comments
following link is Kvs_Pgt_Question Paper...
@Arjun sir how to remove such post? should i hide...
[email protected]
.Plz do share @Sanjay sharma
Please post it as question
This is blog area post it as question
39,823
questions
46,798
answers
140,946
comments
58,883
users