

MCQOPTIONS
Saved Bookmarks
1. |
A class of machine which accepts a ________ language is called finite state automata. |
A. | type 0 |
B. | type 1 |
C. | type 2 |
D. | type 3 |
Answer» E. | |