Abstract
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.
Language: English
Page range: 163 - 171
Published on: Jul 14, 2009
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Related subjects:
© 2009 Michał Trybulec, published by University of Białystok
This work is licensed under the Creative Commons License.