 |  Regular Expressions, Languages, Grammar & Finite Automata 20 Flashcards |  Start |
 | What are the two types of Finite Automata (FA)? |  Card: 1 / 20 |
| Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata (NFA) | Card: 2 / 20 |
| Fill in the blank: A DFA is characterized by a transition function defined as δ: Q X ∑ → ______. | Card: 3 / 20 |
| Q | Card: 4 / 20 |
| True or False: Every NFA can be converted into a DFA, but not every DFA can be converted into an NFA. | Card: 5 / 20 |
| False. Every DFA can be seen as an NFA, but not every NFA can be directly converted back into a DFA. | Card: 6 / 20 |
| Riddle: I can move without input in one step, but I am not a ghost. What am I? | Card: 7 / 20 |
| Nondeterministic Finite Automaton (NFA) | Card: 8 / 20 |
| What is the formal specification of a Finite Automaton? | Card: 9 / 20 |
| { Q, ∑, q, F, δ } | Card: 10 / 20 |
|  Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only | |
| In the context of regular expressions, the operation denoted by '*' signifies ______. | Card: 11 / 20 |
| Kleene Closure | Card: 12 / 20 |
| Which closure property of regular languages states that the union of two regular languages is also regular? | Card: 13 / 20 |
| Union | Card: 14 / 20 |
| Fill in the blank: The language L = {a^n b^n | n ≥ 0} is ______. | Card: 15 / 20 |
| Not regular | Card: 16 / 20 |
| True or False: A Moore machine's output depends solely on the current state. | Card: 17 / 20 |
| True | Card: 18 / 20 |
| What is the transition function for a Nondeterministic Finite Automaton (NFA) denoted as δ? | Card: 19 / 20 |
| Δ: Q X (∑ U ϵ) → 2^Q | Card: 20 / 20 |
| Completed! Keep practicing to master all of them. |  Restart |
