MCQOPTIONS
Saved Bookmarks
| 1. |
Which of the following can be recognized by a Deterministic Finite-state Automaton ? |
| A. | Set of binary string in which number of zeros is same as the number of ones. |
| B. | Numbers, 1,2,4, ....... zN ..... written in binary. |
| C. | Set of binary string in which number of zeros is same as the number of ones. |
| D. | Numbers 1, 2, 4, ........, zN ...... written in unbinary. |
| Answer» C. Set of binary string in which number of zeros is same as the number of ones. | |