Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-16T00:50:50.511Z 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.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Bar-Hillel, Y., Perles, M., and Shamir, E., On formal properties of simple phrase structure grammars, Z. Phonetik, Sprachwiss. und Kommunikationsforsch., 14 (1961), 143172.Google Scholar
2. Elgot, C., Decision problems of finite automata design and related arithmetics, Trans. Amer. Math. Soc., 98 (1961), 2151.Google Scholar
3. Ginsburg, S., An introduction to mathematical machine theory (Reading, Mass., 1962).Google Scholar
4. Ginsburg, S. and Rice, H. G., Two families of languages related to ALGOL, J. Assoc. Comput. Mach., 9 (1962), 350371.Google Scholar
5. Ginsburg, S. and Rose, G. F., Operations which preserve definability in languages, J. Assoc. Comput. Mach., 19 (1963), 175195.Google Scholar
6. Letichevskii, A., Automatic expansions of representations of free semigroups, U.S.S.R. Comput. Math, and Math. Phys. (1963), 489496.Google Scholar
7. Raney, G., Sequential functions, J. Assoc. Comput. Mach., 5 (1958), 177180.Google Scholar