0 votes 0 votes Show that the class of context-free languages is closed under the regular operations$,$ union$,$ concatenation, and star$.$ Theory of Computation michael-sipser theory-of-computation context-free-language + – admin asked May 4, 2019 admin 203 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.