Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged regular-grammar
0
votes
1
answer
1
Regular grammar
Çșȇ ʛấẗẻ
172
views
Çșȇ ʛấẗẻ
asked
Nov 22, 2023
Theory of Computation
theory-of-computation
regular-grammar
finite-automata
+
–
0
votes
1
answer
2
Give a regular expression for L = {a^nb^m: n ≥ 1,m ≥ 1,nm ≥ 3}.
Rahhhhhul
851
views
Rahhhhhul
asked
Jun 12, 2023
Theory of Computation
regular-expression
regular-language
regular-grammar
theory-of-computation
+
–
0
votes
1
answer
3
Regular expression Theory of Computation
Answer this
Answer this
Snehil01
461
views
Snehil01
asked
May 27, 2023
Theory of Computation
theory-of-computation
regular-expression
regular-grammar
+
–
0
votes
0
answers
4
PDA | TOC | Practice Question
Identify the type of the given language and draw the corresponding automata for the language. $L=\left \{a^{i}b^{j}c^{k} \space\ | \space\ j=max(i,k) \right \}$ A] Regular B] DCFL C] CFL but not DCFL D] Non-CFL Please describe your selection.
Identify the type of the given language and draw the corresponding automata for the language.$L=\left \{a^{i}b^{j}c^{k} \space\ | \space\ j=max(i,k) \right \}$A] RegularB...
anupamsworld
509
views
anupamsworld
asked
Sep 2, 2022
Theory of Computation
regular-grammar
context-free-grammar
npda
dpda
theory-of-computation
+
–
2
votes
2
answers
5
KTU University Exam 2021
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language corresponds to regular expression r2. 2 3 1 none of the above
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language co...
Ash666
1.3k
views
Ash666
asked
Sep 12, 2021
Theory of Computation
theory-of-computation
regular-expression
regular-language
regular-grammar
+
–
2
votes
2
answers
6
Conversion of regular grammar to FA
A->aB/bA/b B->aC/bB C->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there? According to me there should be 2 final states: A and C But the resource from where I am reading it says only one final state will be there which will be A. Kindly explain.
A->aB/bA/bB->aC/bBC->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there?According to me there should be 2 final states: A...
Akash Kumar Roy
4.5k
views
Akash Kumar Roy
asked
Jun 3, 2019
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
+
–
0
votes
0
answers
7
Peter Linz Edition 4 Exercise 5.2 Question 11 (Page No. 145)
Is it possible for a regular grammar to be ambiguous?
Is it possible for a regular grammar to be ambiguous?
Naveen Kumar 3
149
views
Naveen Kumar 3
asked
Apr 14, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
ambiguous
+
–
1
votes
0
answers
8
Peter Linz Edition 4 Exercise 3.3 Question 17 (Page No. 97)
Let $G_1 = (V_1,Σ,S_1,P_1)$ be right-linear and $G_2= (V_2, Σ,S_2,P_2)$ be a left-linear grammar, and assume that $V_1$ and $V_2$ are disjoint. Consider the linear grammar $G =(${$S$}$ ∪ V_1 ∪ V_2, Σ,S, P)$, where $S$ is not in $V_1 ∪ V_2$ and $P =$ {$S → S_1|S_2$}$ ∪ P_1 ∪ P_2$. Show that $L(G)$ is regular.
Let $G_1 = (V_1,Σ,S_1,P_1)$ be right-linear and $G_2= (V_2, Σ,S_2,P_2)$ be a left-linear grammar, and assume that $V_1$ and $V_2$ are disjoint. Consider the linear gram...
Naveen Kumar 3
186
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
2
answers
9
Peter Linz Edition 4 Exercise 3.3 Question 15 (Page No. 97)
Show that any regular grammar $G$ for which $L (G) ≠ Ø$ must have at least one production of the form $A → x$ where $A ∈ V$ and $x ∈ T^ *$.
Show that any regular grammar $G$ for which $L (G) ≠ Ø$ must have at least one production of the form $A → x$ where $A ∈ V$ and $x ∈ T^ *$.
Naveen Kumar 3
345
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
10
Peter Linz Edition 4 Exercise 3.3 Question 14 (Page No. 97)
Show that for every regular language not containing $λ$ there exists a right-linear grammar whose productions are restricted to the forms $A → aB$, or $A → a$, where $A, B ∈ V,$ and $a ∈ T$
Show that for every regular language not containing $λ$ there exists a right-linear grammar whose productions are restricted to the forms ...
Naveen Kumar 3
231
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
11
Peter Linz Edition 4 Exercise 3.3 Question 13 (Page No. 97)
Find regular grammars for the following languages on {$ a, b$}. (a) $L=${$w:n_a(w)$ and $n_b(w)$ are both even}. (b) $L=${$w:(n_a(w)$ - $n_b(w))$ mod $3=1$}. (c) $L=${$w:(n_a(w)$ - $n_b(w))$ mod $3\neq1$}. (d) $L=${$w:(n_a(w)$ - $n_b(w))$ mod $3\neq0$}. (e) $L=${$w:|n_a(w)$ - $n_b(w)|$ is odd}.
Find regular grammars for the following languages on {$ a, b$}. (a) $L=${$w:n_a(w)$ and $n_b(w)$ are both even}. (b) $L=${$w:(n_a(w)$ - $n_b(w))$ mod $3=1$}. (c) $L=${$w:...
Naveen Kumar 3
221
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
12
Peter Linz Edition 4 Exercise 3.3 Question 12 (Page No. 97)
Find a regular grammar that generates the language $L=$ {$w∈$ {$a,b$}$^*:n_a(w)+3n_b(w)$ is even } .
Find a regular grammar that generates the language $L=$ {$w∈$ {$a,b$}$^*:n_a(w)+3n_b(w)$ is even } .
Naveen Kumar 3
154
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
13
Peter Linz Edition 4 Exercise 3.3 Question 11 (Page No. 97)
Find a regular grammar for the language $L =$ {$a^nb^m : n + m$ is even}.
Find a regular grammar for the language $L =$ {$a^nb^m : n + m$ is even}.
Naveen Kumar 3
169
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
14
Peter Linz Edition 4 Exercise 3.3 Question 10 (Page No. 97)
Find a left-linear grammar for the language $L ((aab^*ab)^*).$
Find a left-linear grammar for the language $L ((aab^*ab)^*).$
Naveen Kumar 3
152
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
15
Peter Linz Edition 4 Exercise 3.3 Question 7 (Page No. 97)
Find a regular grammar that generates the language on $Σ =$ {$a, b$} consisting of all strings with no more than three $a$'s.
Find a regular grammar that generates the language on $Σ =$ {$a, b$} consisting of all strings with nomore than three $a$'s.
Naveen Kumar 3
158
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
1
answer
16
Peter Linz Edition 4 Exercise 3.3 Question 5 (Page No. 96)
Find a left-linear grammar for the language accepted by the nfa below.
Find a left-linear grammar for the language accepted bythe nfa below.
Naveen Kumar 3
474
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
17
Peter Linz Edition 4 Exercise 3.3 Question 4 (Page No. 96)
Construct right- and left-linear grammars for the language $L =$ {$a^nb^m : n ≥ 2, m ≥ 3$}.
Construct right- and left-linear grammars for the language$L =$ {$a^nb^m : n ≥ 2, m ≥ 3$}.
Naveen Kumar 3
198
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
18
Peter Linz Edition 4 Exercise 3.3 Question 3 (Page No. 96)
Construct a left-linear grammar for the language generated by the grammar $S → abA,$ $A → baB,$ $B → aA|bb.$
Construct a left-linear grammar for the language generated by the grammar$S → abA,$$A → baB,$$B → aA|bb.$
Naveen Kumar 3
188
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
19
Peter Linz Edition 4 Exercise 3.3 Question 2 (Page No. 96)
Find a regular grammar that generates the language $L (aa^* (ab+ a)^*)$ .
Find a regular grammar that generates the language $L (aa^* (ab+ a)^*)$ .
Naveen Kumar 3
198
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
0
answers
20
Peter Linz Edition 4 Exercise 3.3 Question 1 (Page No. 96)
Construct a dfa that accepts the language generated by the grammar $S → abA, A → baB, B → aA|bb$ .
Construct a dfa that accepts the language generated by the grammar$S → abA,A → baB,B → aA|bb$ .
Naveen Kumar 3
215
views
Naveen Kumar 3
asked
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
2
votes
1
answer
21
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}
what is the regular grammar for L={$a^nb^m$ | n+m is even}
aditi19
915
views
aditi19
asked
Feb 24, 2019
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-language
regular-expression
regular-grammar
+
–
1
votes
0
answers
22
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
Construct a right linear grammar for the language $L((aab^*ab)^*)$is this grammar correct? S->aaA | εA->bA | abA | S
aditi19
494
views
aditi19
asked
Feb 24, 2019
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-language
regular-grammar
+
–
0
votes
1
answer
23
Practice Question
How to prove that $ (a+b)^*ab(a+b)^*+b^*a^* = (a+b)^*$
How to prove that $ (a+b)^*ab(a+b)^*+b^*a^* = (a+b)^*$
Hardik Maheshwari
362
views
Hardik Maheshwari
asked
Jan 14, 2019
Theory of Computation
theory-of-computation
regular-expression
regular-language
regular-grammar
+
–
0
votes
1
answer
24
Doubt UGC NET
https://gateoverflow.in/13365/ugcnet-dec2014-iii-24 i’ve a small doubt in the solution of this question how is (a+b)*ba(a+b)* complement of the given language?
https://gateoverflow.in/13365/ugcnet-dec2014-iii-24i’ve a small doubt in the solution of this questionhow is (a+b)*ba(a+b)* complement of the given language?
aditi19
929
views
aditi19
asked
Dec 14, 2018
Theory of Computation
regular-language
regular-grammar
query
+
–
1
votes
1
answer
25
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
If a grammar G is both left linear as well as right linear then,what should be the case a) G is always not regularb) G may or may not be regularc) something else
Abbas Ahmad
400
views
Abbas Ahmad
asked
Nov 30, 2018
Theory of Computation
theory-of-computation
regular-grammar
finite-automata
+
–
0
votes
1
answer
26
Are these two languages equal?
L1=ab* L2=a(aa)*b(bb)* Are the languages equal if not what relation do they satisfy?
L1=ab*L2=a(aa)*b(bb)*Are the languages equal if not what relation do they satisfy?
sripo
545
views
sripo
asked
Nov 6, 2018
Theory of Computation
theory-of-computation
regular-language
regular-grammar
+
–
0
votes
1
answer
27
This question is taken from a sample paper
Consider the following grammar G. Is this regular? S →EF E → a|∈ F → abF|ac
Consider the following grammar G. Is this regular?S →EFE → a|∈F → abF|ac
Piyush Agarwal 1
221
views
Piyush Agarwal 1
asked
Nov 3, 2018
Theory of Computation
finite-automata
regular-language
regular-grammar
+
–
0
votes
1
answer
28
I came across this in a test paper
Consider the following grammar G. Is this regular? S →EF E → a|∈ F → abF|ac
Consider the following grammar G. Is this regular?S →EFE → a|∈F → abF|ac
Piyush Agarwal 1
202
views
Piyush Agarwal 1
asked
Nov 3, 2018
Theory of Computation
regular-grammar
regular-language
finite-automata
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register