Radix enumeration of rational languages is almost co-sequential.

Pierre-Yves Angrand (1) , Jacques Sakarovitch (1)

1 LTCI - Laboratoire Traitement et Communication de l'Information

We define and study here the class of rational functions that are finite union of sequential functions. These functions can be realized by cascades of sequential transducers. After showing that cascades of any height are equivalent to cascades of height at most two and that this class strictly contains sequential functions and is strictly contained in the class of rational functions, we prove the result whose statement gives the paper its title.

Mots clés: finite automata; rational functions of words; sequential transducers

Domaines: Informatique et langage [cs.CL]

Pierre-Yves Angrand, Jacques Sakarovitch. Radix enumeration of rational languages is almost co-sequential.. 2008. ⟨hal-00647052⟩