REPRESENTATION OF RATIONAL FUNCTIONS WITH PREFIX AND SUFFIX CODINGS

: HARJU T, KLEIJN HCM, LATTEUX M, TERLUTTE A

Publisher: ELSEVIER SCIENCE BV

: 1994

: Theoretical Computer Science

: THEORETICAL COMPUTER SCIENCE

: THEOR COMPUT SCI

: 134

: 2

: 403

: 413

: 11

: 0304-3975

DOI: https://doi.org/10.1016/0304-3975(94)90245-3

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.

Mathematics