Theory of computation: Summary of main concepts

3. Finite automata and regular languages: theory

Probabilistic FA
- a NFA whose transitions are assigned probabilities
va

State Minimization
- dynamic programming algorithm - pairs of non-equivalent states are gradually being identified
d
(series-parallel-loop construction)

Non-deterministic FA (NFA)

contained in
(-Hull)

contained in

-free NFA

(power set)

Deterministic FA (DFA)

re la
(dynamic programming)

te

v ar

ia n

d es

crib

ed

by

Finite State Machine (fsm)

- with output alphabet - output either attached to transition (h: Q x A B) or to current state (g: Q B)

Regular Languages

a rel

ted

d es

Pumping Lemma
- used to prove non-regularity - Def.: L regular, n(L), w L, |w| n, w = xyz: 1) |xy| n, 2) |y| > 0, 3) i 0, x y i z L.

Closure Properties
- closed under union, concatenation, Kleene star, intersection and complement - proof by construction of suitable FAs

J. Nievergelt & C. Lucas, 2005.11

crib

- M = (Q,A,f,s0,F)

ed

Finite Automata (FA)

is a

by

r ia nt

Regular Expressions (RE)

is a

- primitive and compound expressions

is a

a rel t ed