Given the two languages L2 & L4 and the DFA:

L2 = { , aa, aaaa, aaaaaa, aaaaaaaa, .................}

In other words, L2 = {w | w has an even number of as}

L4 = { aaaa, aaaaaaaa, .................}

In other words, L4 = {w | w has number of as that is a positive multiple of 4}

The DFA accepts the strings in both L2 and L4 or L2 or L4

The language of the DFA is both L2 and L4 or L2 or L4

A machine may accept all the strings from several languages. but it always recognizes only one language i.e. Any given DFA recognizes one and only one language True or False

If the machine accepts no strings, it still recognizes one language - namely, the empty language True or False