2 votes 2 votes $a) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ or\ j\ \neq k\ \}$ $b) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ and\ j\ \neq k\ \}$ a) CFL(union of two OR-ed comparisons ) b) CSL( Double comaprison ) Am I correct? Theory of Computation theory-of-computation context-sensitive context-free-language + – Tuhin Dutta asked Dec 4, 2017 Tuhin Dutta 684 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply abhishek tiwary commented Dec 4, 2017 reply Follow Share yes 1 is CFL 2 CSL 1 votes 1 votes Ashwin Kulkarni commented Dec 4, 2017 reply Follow Share Yes your reasons are also correct. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes It can be analyse in this way also CFL is not closed under intersection so it takes single comparison means union CFL closed under intersection (and) so it takes double comparison Both are correct Ram Swaroop answered Dec 19, 2018 Ram Swaroop comment Share Follow See all 0 reply Please log in or register to add a comment.