REPRESENTATION OF RATIONAL FUNCTIONS WITH PREFIX AND SUFFIX CODINGS

Authors
HARJU T KLEIJN HCM LATTEUX M TERLUTTE A
Citation
T. Harju et al., REPRESENTATION OF RATIONAL FUNCTIONS WITH PREFIX AND SUFFIX CODINGS, Theoretical computer science, 134(2), 1994, pp. 403-413
Citations number
16
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
134
Issue
2
Year of publication
1994
Pages
403 - 413
Database
ISI
SICI code
0304-3975(1994)134:2<403:RORFWP>2.0.ZU;2-Y
Abstract
We proceed with the characterization of rational functions by means of restricted class of morphisms. Left subsequential transductions can b e factored in an endmarking followed by an uniform morphism, the inver se 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.