Consider regular expression (0 + 1) (0 + 1) ....... n times. Minimum state finite automaton that recognizes the language represented by this regular expression contains
| A. | n states |
| B. | n + 1 states |
| C. | n + 2 states |
| D. | none of these |
|
Option: B Explanation : Click on Discuss to view users comments. thangam said: (8:31pm on Tuesday 19th May 2015)
gate 1999(1.4) give that answer C.so B is right or wrong?
|
If regular set A is represented by A = (01 + 1)* and the regular set 'B' is represented by B = ((01)*1*)*, then
| A. | A ⊂ B |
| B. | B ⊂ A |
| C. | A and B are uncomparable |
| D. | A=B |
|
Option: D Explanation : Click on Discuss to view users comments. |
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, ......} |
|
Option: A Explanation : Click on Discuss to view users comments. |
