CSU Fresno
posted by Vicky Muda on .
Give an example of languages L1 and L2 that satisfy the conditions (a)
L1L2=L2L1, (b) L2 is a proper nonempty subset of L1, and (c) L2≠{ε}.

Your subject is NOT the name of your school.

Ya sorry the subject code is CSCI 119. Finite Automate but this sum is of Regular Languages

Anyone?