Consider the following languages:
Which of the languages are regular?
L1 -> This is CSL
L2 -> This is CFL.
L3 -> This is regular. Regular expression (00)*
L4 -> This is CSL.
Answer -> D
L1, L2 are not Regular because we can't compare strings in Finite Automata. L1 is CSL, L2 is CFL
L3 is Regular because strings generated by L3 are even no of 0's.
L4 is not Regular because we can't design FA.