A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
REPRESENTATION OF RATIONAL FUNCTIONS WITH PREFIX AND SUFFIX CODINGS
Tekijät: HARJU T, KLEIJN HCM, LATTEUX M, TERLUTTE A
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 1994
Lehti:: Theoretical Computer Science
Tietokannassa oleva lehden nimi: THEORETICAL COMPUTER SCIENCE
Lehden akronyymi: THEOR COMPUT SCI
Vuosikerta: 134
Numero: 2
Aloitussivu: 403
Lopetussivu: 413
Sivujen määrä: 11
ISSN: 0304-3975
DOI: https://doi.org/10.1016/0304-3975(94)90245-3
Tiivistelmä
We proceed with the characterization of rational functions by means of restricted class of morphisms. Left subsequential transductions can be factored in an endmarking followed by an uniform morphism, the inverse of a prefix morphism and an alphabetic morphism. Rational functions require the inverse of a prefix morphism followed by the inverse of a suffix morphism.
We proceed with the characterization of rational functions by means of restricted class of morphisms. Left subsequential transductions can be factored in an endmarking followed by an uniform morphism, the inverse of a prefix morphism and an alphabetic morphism. Rational functions require the inverse of a prefix morphism followed by the inverse of a suffix morphism.
Turun yliopiston Tutkimustietojärjestelmän portaali