A labelled terminal transition system is a quadruple (Γ, A, T, ⇒) where Γ is a set of configurations and A is a set of actions, T is a set of terminal configurations and ⇒ ⊆ Γ × A × Γ is the transition relation.
See also labelled transition system.
R. Burstall. Language Semantics and Implementation. Course Notes. 1994.
Copyright © 2014 Barry Watson. All rights reserved.