Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T19:17:02.170Z Has data issue: false hasContentIssue false

A Characterization of Machine Mappings

Published online by Cambridge University Press:  20 November 2018

Seymour Ginsburg
Affiliation:
System Development Corporation, Santa Monica, California
Gene F. Rose
Affiliation:
System Development Corporation, Santa Monica, California
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A generalized sequential machine (abbreviated gsm) is a 6-tuple (K, ∑, Δ, δ, λ, p1), 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 p1 (the “start“ state) is a distinguished element of K.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1966