MCQOPTIONS
Saved Bookmarks
| 1. |
Which of the following problems is undecidable ? |
| A. | To determine if two finite automata are equivalent |
| B. | Membership problem for context free grammar |
| C. | Finiteness problem for finite automata |
| D. | Ambiguity problem for context free grammar |
| Answer» E. | |