Numbers, 1,2,4, ....... zN ..... written in binary.
Numbers 1, 2, 4, ........, zN ...... written in unbinary.
Set of binary string in which number of zeros is same as the number of ones.
Set (1,101,11011,1110111, ......}
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
1 stack is more powerful than an FSM with no stack
1 stack is more powerful than a FSM with 2 stacks
both (a) and (b)
none of these
even
odd
null
3
1
2