Labelled State Transition Systems
Michał Trybulec · Formalized Mathematics · 2009
Labelled State Transition SystemsThis article introduces labelled state transition systems, where transitions may be labelled by words from a given alphabet. Reduction relations from [4] are used to define transitions between states, acceptance of words, and reachable states. Deterministic transition systems are also defined.