Skip to content
Go back

Finite Automata, Part 2

Published:  at  10:00 PM

I. 5-Tuple Definition of DFAs

A. Components

1. Q — States

2. Σ — Alphabet

3. δ — Transition Function

4. q0 — Start State

5. F — Accepting (aka Final) States

B. Acceptance

  1. A DFA reads an input string wΣ* symbol-by-symbol.
  2. Formally, textbooks define the extended transition function:
    • δ*: Q × Σ* → Q where:
      • δ*(q, 𝜖) = q
      • δ*(q, x⋅a ) = δ( δ*(q,x), a ) where xΣ* and aΣ
        • x⋅a means “x concatenated with a”; it is not multiplication.
  3. Acceptance test: A DFA M accepts w iff δ*( q0, w ) ∈ F.

Ignore registers below

“ap = Upper case sigma aka Alphabet Σ “sp = Sigma Star (Uppercase Sigma with Asterisk) Σ* “lp = lowercase delta δ “kp = lowercase delta STAR italicized δ* “ep = lowercase epsilon aka the empty string 𝜖 “bp = subset of; ⊆ “up = Union symbol ∪ “zp = empty set symbol ∅ “dp = dot product symbol ⋅ “np = NOT equal sign ≠ “xp = vanilla multiplication symbol × “rp = right-pointing arrow →

“lp = L “mp = element of; ∈

Samples

macros

@e = turn exactly one character bold