6.1.1 Single literal symbol

A single literal symbol σ in a regular expression is represented by a state machine with two state u₁,u₂ such that T(u₁,σ) = u₂. In this case, u₁ serves as the local start state, and u₂ serves as the local accept state.