1 1 vote Let $L = \{a^nb^nc^nd^n | n\ge1\}$. Show that $L$ can be expressed as the intersection of two context-free languages. Theory of Computation theory-of-computation context-free-language + – moe12leb 636 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply anon1 commented Dec 3, 2022 reply Follow flag can be done using intersection of 3 context free language 0 0 replyShare moe12leb commented Dec 4, 2022 reply Follow flag can u do it ? 0 0 replyShare anon1 commented Dec 5, 2022 reply Follow flag L1 = {a^n b^n c^m d^k} L2 = {a^n b^m c^m d^k} L3 = {a^n b^k c^m d^m} where n,k,m>=1 The intersection of these three languages. 1 1 replyShare Please log in or register to add a comment.