Register

Peter Linz Edition 4 Exercise 6.1 Question 5 (Page No. 161)

377 views

1 Answer

1 votes
1 votes
the language is empty

as none of  the production can be transformed to a sentence.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
Naveen Kumar 3 asked Apr 15, 2019
505 views
Peter Linz Edition 4 Exercise 6.1 Question 6 (Page No. 161)
Eliminate useless productions from $S\rightarrow a|aA|B|C,$ $A\rightarrow aB|\lambda,$ $B\rightarrow Aa,$ $C\rightarrow cCD,$ $D\rightarrow ddd.$
Eliminate useless productions from$S\rightarrow a|aA|B|C,$$A\rightarrow aB|\lambda,$$B\rightarrow Aa,$$C\rightarrow cCD,$$D\rightarrow ddd.$
User Avatar
0 votes
0 votes
0 answers
2
Naveen Kumar 3 asked Apr 15, 2019
286 views
Peter Linz Edition 4 Exercise 6.1 Question 4 (Page No. 161)
In Theorem 6.1, why is it necessary to assume that $A$ and $B$ are different variables?
In Theorem 6.1, why is it necessary to assume that $A$ and $B$ are different variables?
User Avatar
0 votes
0 votes
0 answers
3
Naveen Kumar 3 asked Apr 15, 2019
186 views
Peter Linz Edition 4 Exercise 6.1 Question 3 (Page No. 161)
Show that the two grammars $S\rightarrow abAB|ba,$ $A\rightarrow aaa,$ $B\rightarrow aA|bb$ and $S\rightarrow abAaA|abAbb|ba,$ $A\rightarrow aaa$ are equivalent.
Show that the two grammars$S\rightarrow abAB|ba,$$A\rightarrow aaa,$$B\rightarrow aA|bb$ and$S\rightarrow abAaA|abAbb|ba,$$A\rightarrow aaa$ ...
User Avatar
Link Copied!