1 votes 1 votes Theory of Computation theory-of-computation made-easy-test-series context-free-language regular-language + – vaishali jhalani asked Jan 20, 2017 • edited Mar 4, 2019 by adeebafatima1 vaishali jhalani 448 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes L1 is n(b)=3n(a) {no restriction on order in which a's and b's appear.} L2 is having above condition too, but have an extra restriction on the order. so, L2 is definitely a subset (a proper subset) of L1. Lucky sunda answered Jan 20, 2017 Lucky sunda comment Share Follow See all 2 Comments See all 2 2 Comments reply vaishali jhalani commented Jan 21, 2017 reply Follow Share IN L2 nothing is said about b. 0 votes 0 votes Lucky sunda commented Jan 21, 2017 reply Follow Share In L2, every a is followed by 3 b's. 0 votes 0 votes Please log in or register to add a comment.
