Register

Ullman (TOC) Edition 3 Exercise 7.3 Question 3 (Page No. 297)

124 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
admin asked Apr 11, 2019
107 views
Ullman (TOC) Edition 3 Exercise 7.3 Question 2 (Page No. 297)
Consider the following languages$:$ $L_{1}=\{a^{n}b^{2n}c^{m}|n,m\geq 0\}$ $L_{2}=\{a^{n}b^{m}c^{2m}|n,m\geq 0\}$ Show that each of these languages is context-free by giving grammars for each. Is $L_{1}\cap L_{2}$ a $CFL?$ Justify your answer.
Consider the following languages$:$$L_{1}=\{a^{n}b^{2n}c^{m}|n,m\geq 0\}$$L_{2}=\{a^{n}b^{m}c^{2m}|n,m\geq 0\}$Show that each of these languages is context-free by giving...
User Avatar
0 votes
0 votes
0 answers
3
admin asked Apr 11, 2019
114 views
Ullman (TOC) Edition 3 Exercise 7.3 Question 1 (Page No. 297)
Show that the $CFL's$ are closed under the following$:$ $\text{init},$ Hint$:$ Start with a $CNF$ grammar for the language $L.$ $\text{The operation $L/a,$}$ Hint$:$ Again,start with a $CNF$ grammar for $L.$ $\text{cycle, }$ Hint$:$ Try a $PDA-$based constrction.
Show that the $CFL's$ are closed under the following$:$$\text{init},$ Hint$:$ Start with a $CNF$ grammar for the language $L.$$\text{The operation $L/a,$}$ Hint$:$ Again...
User Avatar
0 votes
0 votes
0 answers
4
admin asked Apr 11, 2019
316 views
Ullman (TOC) Edition 3 Exercise 7.4 Question 5 (Page No. 308)
Modify the $CYK$ algorithm to report the number of distinct parse trees for the given input, rather than just reporting membership in the language$.$
Modify the $CYK$ algorithm to report the number of distinct parse trees for the given input, rather than just reporting membership in the language$.$
User Avatar
Link Copied!