where Q is the state set, Σ is the alphabet, q 0 is the start state, δ is a deterministic transition function, F and T are the final-state and transition probabilities.
t : Q × Σ → R + and F : Like DFAs, for all w ∈ Σ * , there is at most one state reachable from q 0 .