 
			 
			MCQOPTIONS
 Saved Bookmarks
				This section includes 5 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. | An NFA’s transition function returns ________ | 
| A. | A Boolean value | 
| B. | A state | 
| C. | A set of states | 
| D. | An edge | 
| Answer» D. An edge | |
| 2. | NFAs are ________ DFAs. | 
| A. | Larger than | 
| B. | More expressive than | 
| C. | Less expressive than | 
| D. | Equally expressive as | 
| Answer» B. More expressive than | |
| 3. | The Tuples for NDFA is ___________ | 
| A. | ∑, Q, q0, F, δ | 
| B. | Q, q0, F, δ | 
| C. | Θ, Q, q0, F,δ | 
| D. | F, Q, Δ, q0, δ | 
| Answer» B. Q, q0, F, δ | |
| 4. | The regular languages are not closed under ___________ | 
| A. | Concatenation | 
| B. | Union | 
| C. | Kleene star | 
| D. | Complement | 
| Answer» E. | |
| 5. | NDFAs where introduced by ____________ | 
| A. | Michael O Rabin & Dana Scott | 
| B. | Dan Brown | 
| C. | Sun micro system Labs | 
| D. | SAP Labs | 
| Answer» B. Dan Brown | |