A Characterization of Machine Mappings
- 1 January 1966
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 18, 381-388
- https://doi.org/10.4153/cjm-1966-040-3
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Operations Which Preserve Definability in LanguagesJournal of the ACM, 1963
- Automatic expansions of representations of free semigroupsUSSR Computational Mathematics and Mathematical Physics, 1963
- Two Families of Languages Related to ALGOLJournal of the ACM, 1962
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- Sequential FunctionsJournal of the ACM, 1958