A Characterization of Machine Mappings

Abstract

A generalized sequential machine (abbreviated gsm) is a 6-tuple (K, ∑, Δ, δ, λ, p 1 ), where K, ∑, Δ are finite non-empty sets (of “states,” “inputs,” and “outputs” respectively), δ (the “next state” function) is a mapping of K X ∑ into K, λ (the “output” function) is a mapping of K X ∑ into Δ*, and p 1 (the “start“ state) is a distinguished element of K.