A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
DETERMINISTIC SEQUENTIAL FUNCTIONS
Tekijät: HARJU T, KLEIJN HCM, LATTEUX M
Kustantaja: SPRINGER VERLAG
Julkaisuvuosi: 1992
Lehti:: Acta Informatica
Tietokannassa oleva lehden nimi: ACTA INFORMATICA
Lehden akronyymi: ACTA INFORM
Vuosikerta: 29
Numero: 6-7
Aloitussivu: 545
Lopetussivu: 554
Sivujen määrä: 10
ISSN: 0001-5903
DOI: https://doi.org/10.1007/BF01185560
Tiivistelmä
The simple rational partial functions accepted by generalized sequential machines are shown to coincide with the compositions HH(P)-1H, where H(P) consists of the prefix codings. The rational functions accepted by generalized sequential machines are proved to coincide with the compositions HMH(P)-1 RH, where M is the family of endmarkers and R is the family of removals of endmarkers. (The compositions are read from left to right). We also show that MHH(P)-1H is the family of the subsequential functions.
The simple rational partial functions accepted by generalized sequential machines are shown to coincide with the compositions HH(P)-1H, where H(P) consists of the prefix codings. The rational functions accepted by generalized sequential machines are proved to coincide with the compositions HMH(P)-1 RH, where M is the family of endmarkers and R is the family of removals of endmarkers. (The compositions are read from left to right). We also show that MHH(P)-1H is the family of the subsequential functions.
Turun yliopiston Tutkimustietojärjestelmän portaali