Formal definition of DFA

Question

What is the formal definition of DFA ?

Answer 1

A deterministic finite automaton is a 5-tuple

(Q, Σ, δ, q₀, F)

- Q is a finite set called the states
- Σ is a finite set called the alphabet
- δ:Q x Σ→ Q is a function called the transition function
- q₀ is an element of Q called the start state
- F is a subset of Q called the accept states