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 |
Answer : B Explanation : thangam said: (8:31pm on Tuesday 19th May 2015)
gate 1999(1.4) give that answer C.so B is right or wrong?
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
