A1 Refereed original research article in a scientific journal
REPRESENTATION OF RATIONAL FUNCTIONS WITH PREFIX AND SUFFIX CODINGS
Authors: HARJU T, KLEIJN HCM, LATTEUX M, TERLUTTE A
Publisher: ELSEVIER SCIENCE BV
Publication year: 1994
Journal:: Theoretical Computer Science
Journal name in source: THEORETICAL COMPUTER SCIENCE
Journal acronym: THEOR COMPUT SCI
Volume: 134
Issue: 2
First page : 403
Last page: 413
Number of pages: 11
ISSN: 0304-3975
DOI: https://doi.org/10.1016/0304-3975(94)90245-3
Abstract
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.
UTU Research Portal