Finite automata (DFA and NFA) in Compiler Design - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a Deterministic Finite Automaton (DFA)?

A DFA is a type of finite automaton where for each state and input symbol, there is exactly one next state. It has no ambiguity in transitions.

beginner

What distinguishes a Non-deterministic Finite Automaton (NFA) from a DFA?

An NFA can have multiple possible next states for a given state and input symbol, including transitions without input (epsilon moves). It allows choices in paths.

intermediate

Can every NFA be converted to an equivalent DFA?

Yes, for every NFA there exists a DFA that accepts the same language. This is done using the subset construction method.

beginner

What is the role of states in finite automata?

States represent different conditions or situations of the automaton during input processing. They help track progress in recognizing patterns.

beginner

Why are finite automata important in compiler design?

Finite automata are used to recognize patterns like tokens in source code, helping the compiler understand and process programming languages efficiently.

Which of the following is true about a DFA?

A It can have multiple transitions for the same input symbol from a state.

B It cannot recognize regular languages.

C It allows transitions without any input symbol.

D It has exactly one transition for each input symbol from every state.

A DFA has exactly one transition for each input symbol from every state, ensuring no ambiguity.

What does an epsilon (ε) transition in an NFA mean?

A A transition that leads to an error state.

B A transition that consumes one input symbol.

C A transition that does not consume any input symbol.

D A transition that only occurs at the start state.

Epsilon transitions allow the automaton to change states without reading any input symbol.

Which statement is correct about the languages recognized by DFA and NFA?

A Both recognize exactly the same set of languages.

B NFA recognizes more languages than DFA.

C Neither can recognize regular languages.

D DFA recognizes more languages than NFA.

Both DFA and NFA recognize exactly the same set of languages called regular languages.

What is the first step in converting an NFA to a DFA?

A Creating a start state representing the epsilon closure of the NFA start state.

B Removing unreachable states.

C Minimizing the number of states.

D Adding epsilon transitions.

The conversion starts by creating a DFA start state that represents the epsilon closure of the NFA's start state.

In finite automata, what is an accepting (final) state?

A A state where the automaton stops processing input.

B A state that indicates the input string is accepted by the automaton.

C A state that has no outgoing transitions.

D A state that always leads to rejection.

An accepting state means the automaton accepts the input string if it ends in that state.

Explain the difference between a DFA and an NFA with examples.

Think about how the machine moves from one state to another on input.

Describe how finite automata are used in the process of compiling a programming language.

Consider the first step of a compiler that reads source code.

Practice

1. What is the main difference between a Deterministic Finite Automaton (DFA) and a Nondeterministic Finite Automaton (NFA)?

easy

A. DFA can have multiple transitions for the same symbol, NFA cannot.

B. DFA has exactly one transition for each symbol from a state, NFA can have multiple or none.

C. NFA always accepts fewer strings than DFA.

D. DFA uses infinite memory, NFA uses finite memory.

Solution

1. Step 1: Understand DFA transitions

   DFA has exactly one possible next state for each input symbol from any given state.

2. Step 2: Understand NFA transitions

   NFA can have zero, one, or multiple possible next states for the same input symbol from a state.

3. Final Answer:

   DFA has exactly one transition for each symbol from a state, NFA can have multiple or none. -> Option B

4. Quick Check:

   DFA unique move, NFA multiple moves [OK]

Hint: DFA = one move per input; NFA = many or none [OK]

Common Mistakes:

• Thinking NFA has fewer transitions than DFA
• Confusing memory usage between DFA and NFA
• Believing DFA can have multiple transitions for same input

2. Which of the following is the correct way to represent a transition in a DFA?

easy

A. From state q0, on input 'a', go to state q1.

B. From state q0, on input 'a', go to states q1 and q2.

C. From state q0, on input 'a', stay in q0 and q1 simultaneously.

D. From state q0, on input 'a', no transition is allowed.

Solution

1. Step 1: Recall DFA transition rules

   DFA must have exactly one next state for each input symbol from a given state.

2. Step 2: Analyze options

   From state q0, on input 'a', go to state q1. shows one next state for input 'a' from q0, which matches DFA rules.

3. Final Answer:

   From state q0, on input 'a', go to state q1. -> Option A

4. Quick Check:

   DFA transitions are single and deterministic [OK]

Hint: DFA transitions go to exactly one state per input [OK]

Common Mistakes:

• Choosing multiple next states for DFA transitions
• Allowing no transition in DFA for an input symbol
• Confusing NFA transitions with DFA

3. Consider the following NFA with states {q0, q1}, start state q0, and final state q1. Transitions: q0 --a--> q0, q0 --a--> q1. What strings does this NFA accept?

medium

A. All strings with at least one 'a'.

B. All strings with zero or more 'a's.

C. Only strings with exactly one 'a'.

D. Only the empty string.

Solution

1. Step 1: Analyze transitions

   From q0, on input 'a', NFA can stay in q0 or move to q1 (final).

2. Step 2: Determine accepted strings

   Since q1 is final and reachable after at least one 'a', all strings with one or more 'a's are accepted.

3. Final Answer:

   All strings with at least one 'a'. -> Option A

4. Quick Check:

   NFA accepts strings reaching final state q1 [OK]

Hint: NFA accepts if any path reaches final state [OK]

Common Mistakes:

• Assuming only one path matters
• Thinking empty string is accepted without epsilon transitions
• Confusing zero or more with at least one

4. Identify the error in this DFA description: States = {q0, q1}, Start = q0, Final = q1, Transitions: q0 --a--> q1, q0 --a--> q0, q1 --b--> q1.

medium

A. Transitions must include input 'c'.

B. Start state cannot be q0.

C. DFA cannot have two transitions for the same input from one state.

D. Final state cannot be q1.

Solution

1. Step 1: Check transitions from q0

   There are two transitions from q0 on input 'a' going to q1 and q0.

2. Step 2: Recall DFA rules

   DFA must have exactly one transition per input symbol from each state; multiple transitions for same input are invalid.

3. Final Answer:

   DFA cannot have two transitions for the same input from one state. -> Option C

4. Quick Check:

   DFA unique transition per input per state [OK]

Hint: DFA must have one transition per input per state [OK]

Common Mistakes:

• Allowing multiple transitions for same input in DFA
• Confusing start and final state rules
• Expecting all inputs must appear in transitions

5. You want to convert an NFA with epsilon (empty string) transitions to an equivalent DFA. Which of the following steps is essential in this process?

hard

A. Ignore epsilon transitions as they do not affect acceptance.

B. Remove all final states from the NFA.

C. Add multiple start states to the DFA.

D. Compute epsilon-closure of states to find reachable states without input.

Solution

1. Step 1: Understand epsilon transitions

   Epsilon transitions allow moving between states without consuming input.

2. Step 2: Use epsilon-closure in conversion

   To convert NFA with epsilon moves to DFA, compute epsilon-closure to find all states reachable without input, ensuring correct DFA states.

3. Final Answer:

   Compute epsilon-closure of states to find reachable states without input. -> Option D

4. Quick Check:

   Epsilon-closure is key in NFA to DFA conversion [OK]

Hint: Find all states reachable via epsilon before input moves [OK]

Common Mistakes:

• Ignoring epsilon transitions during conversion
• Removing final states incorrectly
• Adding multiple start states to DFA