1)What is the state diagram for L={w|w has odd no of a's}
2)What is the COMPLEMENT of "w is any string except 'a' and 'b'?
3)Is CONCATENATION same as INTERSECTION if regular language is concerned?
4)Is class of regular languages closed under INTERSECTION?
5)How to find intersection of two languages L1 and L2 where L1={w|w has exactly two a's}
L2={w|w has at least two b's}..Plz explain in detail
6)If L={w|w has an even no of a's}
Then can it accept string b* and Epsilon?
7)Give DFA for
i)L={w|w begins with 1 and ends with 0}
ii)L={w|w has length at least 3 and its 3rd symbol is0}