0 votes 0 votes Theory of Computation theory-of-computation grammar + – Vicky rix asked Apr 1, 2017 • retagged Jun 4, 2017 by Arjun Vicky rix 499 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes a) S -> aSb | aSB | b B -> bB | epsilon b) S-> aSbb | epsilon c) S-> aaA A-> aAb | ab (n=1 minimum) d) S-> aaaA A-> aAb | epsilon (n=3 minimum) Edit is coming soon for the rest. Out of patience .. :D Ahwan answered Apr 1, 2017 Ahwan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Please verify h) L1 - L4' = { } . So simply S-->S will not produce any string (including epsilon) Vicky rix answered Apr 1, 2017 • edited Apr 1, 2017 by Vicky rix Vicky rix comment Share Follow See all 0 reply Please log in or register to add a comment.