GATE 1997
December 6, 2023GATE 1998
December 6, 2023Theory-of-Computation
|
Question 41
|
Both A and B are equal, which generates strings over {0,1}, while 0 is followed by 1.
|
The numbers 1, 2, 4, 8, ……………., 2n, ………… written in binary
|
|
|
The numbers 1, 2, 4, ………………., 2n, …………..written in unary
|
|
|
The set of binary string in which the number of zeros is the same as the number of ones
|
|
|
The set {1, 101, 11011, 1110111, ………..}
|
Question 41 Explanation:
The numbers are to be like
10, 100, 1000, 10000 …. = 10*
which is regular and recognized by deterministic finite automata.
10, 100, 1000, 10000 …. = 10*
which is regular and recognized by deterministic finite automata.
Correct Answer: A
Question 41 Explanation:
The numbers are to be like
10, 100, 1000, 10000 …. = 10*
which is regular and recognized by deterministic finite automata.
10, 100, 1000, 10000 …. = 10*
which is regular and recognized by deterministic finite automata.
