Register

Peter Linz Edition 4 Exercise 3.3 Question 5 (Page No. 96)

500 views

1 Answer

0 votes
0 votes

the regular expression is simply (10)*

hence the grammer will be 

S-->S10 | epsilon

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

Related questions

0 votes
0 votes
0 answers
1
Naveen Kumar 3 asked Apr 3, 2019
204 views
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$}.
User Avatar
0 votes
0 votes
0 answers
2
Naveen Kumar 3 asked Apr 3, 2019
198 views
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.$
User Avatar
0 votes
0 votes
0 answers
4
Naveen Kumar 3 asked Apr 3, 2019
220 views
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$ .
User Avatar
Link Copied!