Lecture 3- DFA Flashcards
1
Q
A DFA is a 5-tuple, name them.
A
(Q, Σ, δ, q₀, F)
2
Q
δ
A
Transition function
2
Q
Q
A
the set of states
2
Q
q₀
A
Initial State
3
Q
Σ
A
the alphabet
4
Q
F
A
Set of accepting (final) states.
5
Q
Transition Function (δ) of a DFA
A
δ: Q × Σ → Q
6
Q
DFAs are deterministic, explain what is meant by this.
A
At any point, there’s only one valid transition for a given input symbol in a given state.
