1 votes 1 votes Hi Guys, What will be ${\left ( DCFL \cup Regular \right )} '$ ? Theory of Computation dcfl regular-expression + – Chhotu asked Nov 11, 2017 • edited Nov 11, 2017 by Chhotu Chhotu 1.6k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Shivam Chauhan commented Nov 11, 2017 i reshown by Shivam Chauhan Nov 11, 2017 reply Follow Share DCFL is closed under complementation. 0 votes 0 votes Red_devil commented Nov 11, 2017 reply Follow Share bro but it is closed under intersection with reg language. 0 votes 0 votes reena_kandari commented Nov 11, 2017 reply Follow Share ^ every class of language is closed under "intersection with regular language". 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes (DCFL U Regular)' = DCFL' ⋂ Regular' = DCFL ⋂ Regular = (DCFL -> CFL -> CSL) ⋂ (Reg -> CFL -> CSL ) == CSL. harrygate answered Nov 11, 2017 harrygate comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer is DCFL. ${\left ( DCFL \cup Regular \right )}' = {DCFL}' \cap {Regular}' = {DCFL } \cap { Regular } = DCFL$ Chhotu answered Nov 11, 2017 • edited Nov 13, 2017 by Chhotu Chhotu comment Share Follow See all 2 Comments See all 2 2 Comments reply Arjun commented Nov 12, 2017 reply Follow Share A set is not the same as its element. You can say Delhi Union India is India, but Delhi Intersection Bangalore is not Delhi. Now applying to the question here, you must first clarify what you meant in the question -- a DCFL language or the set of all DCFL languages. 2 votes 2 votes Chhotu commented Nov 13, 2017 reply Follow Share @Arjun ji I think answer should be DCFL for general case. 0 votes 0 votes Please log in or register to add a comment.