Theory of Computation

📌 Topics

• DFA
• NFA
• Regular Expressions
• Pumping Lemma

📘 DFA

Concept

DFA is a finite automaton where each state has exactly one transition for each input.

Key Points

• Deterministic
• No epsilon transitions

PYQ

Can DFA have epsilon transitions?
Answer: No

Quick Revision

DFA → One path
NFA → Multiple paths