String of 0 ′s whose length is a perfect square

Set of all palindromes made up of 0 ′s and 1 ′s

Strings of 0 ′s, whose length is a prime number

All of these

in DFSA, ε transition may be present

in NDFSA, ε transitions may be present

in DFSA, from any given state, there can't be any alphabet leading to two different states

in NDFSA, from any given state, there can't be any alphabet leading to two different states

even

odd

null

none of these

0

1

2

None of these

any grammar

only context-free grammar

Both (a) and (b)

only regular grammar