Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for regular-grammar
54
votes
13
answers
1
GATE CSE 2015 Set 2 | Question: 35
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 non-terminals 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$ ... $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$
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 non-terminal...
go_editor
18.9k
views
go_editor
asked
Feb 12, 2015
Theory of Computation
gatecse-2015-set2
theory-of-computation
regular-grammar
normal
+
–
3
votes
2
answers
2
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Jiten008
357
views
Jiten008
asked
Oct 24, 2023
Theory of Computation
pushdown-automata
theory-of-computation
self-doubt
regular-language
context-free-language
context-sensitive
turing-machine
closure-property
context-free-grammar
+
–
0
votes
1
answer
3
Regular grammar
Çșȇ ʛấẗẻ
189
views
Çșȇ ʛấẗẻ
asked
Nov 22, 2023
Theory of Computation
theory-of-computation
regular-grammar
finite-automata
+
–
0
votes
1
answer
4
Give a regular expression for L = {a^nb^m: n ≥ 1,m ≥ 1,nm ≥ 3}.
Rahhhhhul
1.4k
views
Rahhhhhul
asked
Jun 12, 2023
Theory of Computation
regular-expression
regular-language
regular-grammar
theory-of-computation
+
–
0
votes
1
answer
5
Regular expression Theory of Computation
Answer this
Answer this
Snehil01
473
views
Snehil01
asked
May 27, 2023
Theory of Computation
theory-of-computation
regular-expression
regular-grammar
+
–
0
votes
0
answers
6
An Introduction to Formal Languages and Automata,Peter Linz,6th edition,exercise 3.3 q3
Find a regular grammar that generates the language L (aa ∗ (ab + a) ∗ ).
Find a regular grammar that generates the language L (aa ∗ (ab + a) ∗ ).
Silver_Reaper
516
views
Silver_Reaper
asked
Feb 6, 2023
Theory of Computation
theory-of-computation
regular-language
grammar
peter-linz
+
–
0
votes
0
answers
7
derive a language from a grammar
{M ∈ {a,b}∗ | M contains at least three bs} {N ∈ {a,b}∗ | N has an odd length and a is in the middle always}
{M ∈ {a,b}∗ | M contains at least three bs} {N ∈ {a,b}∗ | N has an odd length and a is in the middle always}
moe12leb
263
views
moe12leb
asked
Jan 21, 2023
Theory of Computation
theory-of-computation
regular-language
context-free-grammar
+
–
0
votes
0
answers
8
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
533
views
anupamsworld
asked
Sep 2, 2022
Theory of Computation
regular-grammar
context-free-grammar
npda
dpda
theory-of-computation
+
–
2
votes
2
answers
9
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
+
–
1
votes
1
answer
10
GATE Overflow Test Series | Mock GATE | Test 4 | Question: 61
Which of the following is/are regular grammar for the given finite automata? (Mark all the appropriate choices) $S_{1} \rightarrow aS_{2} \\ S_{2} \rightarrow a S_{2} \mid bS_{2}$ ... $S_{1} \rightarrow S_{1} a \mid S_{1} b \mid S_{2} a \\ S_{2} \rightarrow \varepsilon$
Which of the following is/are regular grammar for the given finite automata? (Mark all the appropriate choices)$S_{1} \rightarrow aS_{2} \\S_{2} \rightarrow a S_{2} \mid ...
gatecse
226
views
gatecse
asked
Feb 1, 2021
Theory of Computation
go2025-mockgate-4
theory-of-computation
finite-automata
regular-grammar
multiple-selects
+
–
2
votes
1
answer
11
GATE Overflow Test Series | Theory of Computation | Test 1 | Question: 24
Which of the following is/are correct? (Mark all the appropriate choices) A regular grammar is any right-linear or left-linear grammar. $A \rightarrow \alpha A \mid \beta$ ... $T$ is the set of terminals Any grammar which generates a regular language, is a regular grammar
Which of the following is/are correct? (Mark all the appropriate choices)A regular grammar is any right-linear or left-linear grammar.$A \rightarrow \alpha A \mid \beta$ ...
gatecse
378
views
gatecse
asked
Sep 29, 2020
Theory of Computation
go2025-toc-1
regular-grammar
multiple-selects
+
–
1
votes
1
answer
12
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
411
views
Abbas Ahmad
asked
Nov 30, 2018
Theory of Computation
theory-of-computation
regular-grammar
finite-automata
+
–
0
votes
1
answer
13
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
493
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
14
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
237
views
Piyush Agarwal 1
asked
Nov 3, 2018
Theory of Computation
finite-automata
regular-language
regular-grammar
+
–
2
votes
2
answers
15
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.6k
views
Akash Kumar Roy
asked
Jun 3, 2019
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
+
–
2
votes
2
answers
16
Peter Linz 5.1
I need two proves, i am stuckhere 1.Show that every S-grammar is Unambiguous 2.Show that a RegEx can never be Inherently Ambiguous so what to use here? Induction/Contradiction
I need two proves, i am stuckhere1.Show that every S-grammar is Unambiguous2.Show that a RegEx can never be Inherently Ambiguousso what to use here? Induction/Contradicti...
No_name
2.4k
views
No_name
asked
Apr 7, 2017
Theory of Computation
theory-of-computation
context-free-language
regular-expression
regular-language
grammar
+
–
2
votes
4
answers
17
grammer in compiler design
Which of the following is the most general phase-structured grammar? (a) regular (b) context-free (c) context-sensitive (d) none of the above
Which of the following is the most general phase-structured grammar?(a) regular (b) context-free(c) context-sensitive (d) none of the above
vkm07
1.6k
views
vkm07
asked
Jul 31, 2016
Compiler Design
compiler-design
context-free-grammar
regular-grammar
context-sensitive
+
–
1
votes
3
answers
18
Peter Linz Edition 4 Exercise 3.1 Question 7 (Page No. 76) Exercise 3.3 Question 9 (Page No. 97)
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. ... w ∈ {a, b}* / (number of a in w + 3*number of b) in w is even }
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 b...
Shubhanshu
2.0k
views
Shubhanshu
asked
Jul 5, 2017
Theory of Computation
theory-of-computation
regular-language
regular-expression
regular-grammar
peter-linz
peter-linz-edition4
+
–
1
votes
2
answers
19
theory of computtion
find regular expression of 1. S-> 01A/10B A->0B/1 B->1A/0 and 2. A->A00 /A1/0 3. S->baS/aA A->bbA/bb
find regular expression of1.S- 01A/10BA->0B/1B->1A/0and2.A->A00 /A1/0 3.S->baS/aAA->bbA/bb
akankshadewangan24
488
views
akankshadewangan24
asked
Jun 25, 2017
Theory of Computation
regular-expression
grammar
+
–
0
votes
1
answer
20
Michael Sipser Edition 3 Exercise 2 Question 13 (Page No. 156)
Let $G = (V, \Sigma, R, S)$ be the following grammar. $V = \{S, T, U\}; \Sigma = \{0, \#\};$ and $R$ is the set of rules$:$ $S\rightarrow TT\mid U$ $T\rightarrow 0T\mid T0\mid \#$ $U\rightarrow 0U00\mid\#$ Describe $L(G)$ in English. Prove that $L(G)$ is not regular$.$
Let $G = (V, \Sigma, R, S)$ be the following grammar. $V = \{S, T, U\}; \Sigma = \{0, \#\};$ and $R$ is the set of rules$:$$S\rightarrow TT\mid U$$T\rightarrow 0T\mid T0\...
admin
474
views
admin
asked
May 4, 2019
Theory of Computation
michael-sipser
theory-of-computation
context-free-grammar
regular-language
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
