Which of the following can be recognized by a Deterministic Finite-state Automaton ?
| A. | Numbers, 1,2,4, ....... zN ..... written in binary. |
| B. |
Numbers 1, 2, 4, ........, zN ...... written in unbinary.
|
| C. | Set of binary string in which number of zeros is same as the number of ones. |
| D. | Set (1,101,11011,1110111, ......} |
Answer : A Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
