À propos de cet article
Publié en ligne: 14 juil. 2009
Pages: 163 - 171
DOI: https://doi.org/10.2478/v10037-009-0019-5
This content is open access.
This 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.