1 votes 1 votes Let $L$ be any language on a non-empty alphabet. Show that $L$ and $L^c$ cannot both be finite. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation + – Naveen Kumar 3 asked Mar 17, 2019 Naveen Kumar 3 503 views answer comment Share Follow See 1 comment See all 1 1 comment reply Deepak Poonia commented Aug 11, 2022 reply Follow Share Find video solution below: Detailed Video Solution 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Both L and L^c can not both are finite. abhishekmehta4u answered Mar 18, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.