MCQOPTIONS
Saved Bookmarks
| 1. |
Which of the following is strictly more powerful than regular expression? |
| A. | Nondeterministic Finite Automation (NFA) |
| B. | Context-free grammar |
| C. | DFA |
| D. | Recursive function |
| Answer» C. DFA | |