34 search results - page 1 / 7 » On implementing recognizable transductions |
92
Voted
IJCM
2010
14 years 10 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
111
Voted
ITA
2000
15 years 4 days ago
2000
The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of tr...
93
Voted
IANDC
2006
15 years 11 days ago
2006
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
90
Voted
FUIN
2006
15 years 11 days ago
2006
Bimachines are important conceptual tools used for the characterization of rational word functions (realized by single-valued transducers). Despite the attention received in the pa...
112
Voted
TCS
2010
14 years 7 months ago
2010
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...