Let L be a regular language containing only strings of even length. L' is the set of all strings that contain the first half of strings from L. Prove that L' is regular. code example
Example: 1. Write regular expression to describe a languages consist of strings made of even numbers a and b. CO1 K3
((a+b)(a+b))*