Geodesic
A Characterization of Machine Mappings
Canadian journal of mathematics, Tome 18 (1966) no. 1, pp. 381-388

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
Ginsburg, Seymour; Rose, Gene F. A Characterization of Machine Mappings. Canadian journal of mathematics, Tome 18 (1966) no. 1, pp. 381-388. doi: 10.4153/CJM-1966-040-3
@article{10_4153_CJM_1966_040_3,
     author = {Ginsburg, Seymour and Rose, Gene F.},
     title = {A {Characterization} of {Machine} {Mappings}},
     journal = {Canadian journal of mathematics},
     pages = {381--388},
     year = {1966},
     volume = {18},
     number = {1},
     doi = {10.4153/CJM-1966-040-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-040-3/}
}
TY  - JOUR
AU  - Ginsburg, Seymour
AU  - Rose, Gene F.
TI  - A Characterization of Machine Mappings
JO  - Canadian journal of mathematics
PY  - 1966
SP  - 381
EP  - 388
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-040-3/
DO  - 10.4153/CJM-1966-040-3
ID  - 10_4153_CJM_1966_040_3
ER  - 
%0 Journal Article
%A Ginsburg, Seymour
%A Rose, Gene F.
%T A Characterization of Machine Mappings
%J Canadian journal of mathematics
%D 1966
%P 381-388
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-040-3/
%R 10.4153/CJM-1966-040-3
%F 10_4153_CJM_1966_040_3

[1] 1. Bar-Hillel, Y., Perles, M., and Shamir, E., On formal properties of simple phrase structure grammars, Z. Phonetik, Sprachwiss. und Kommunikationsforsch., 14 (1961), 143–172. Google Scholar

[2] 2. Elgot, C., Decision problems of finite automata design and related arithmetics, Trans. Amer. Math. Soc., 98 (1961), 21–51. Google Scholar

[3] 3. Ginsburg, S., An introduction to mathematical machine theory (Reading, Mass., 1962). Google Scholar

[4] 4. Ginsburg, S. and Rice, H. G., Two families of languages related to ALGOL, J. Assoc. Comput. Mach., 9 (1962), 350–371. Google Scholar

[5] 5. Ginsburg, S. and Rose, G. F., Operations which preserve definability in languages, J. Assoc. Comput. Mach., 19 (1963), 175–195. Google Scholar

[6] 6. Letichevskii, A., Automatic expansions of representations of free semigroups, U.S.S.R. Comput. Math, and Math. Phys. (1963), 489–496. Google Scholar

[7] 7. Raney, G., Sequential functions, J. Assoc. Comput. Mach., 5 (1958), 177–180. Google Scholar

Cité par Sources :