| Publication type: |
 |
Preprint, Working Paper, ... |
|
| Subject: |
|
Computer Science/Computation and Language
|
|
| Title: |
|
Radix enumeration of rational languages is almost co-sequential. |
|
| Author(s): |
|
Pierre-Yves Angrand ( ) 1, Jacques Sakarovitch () 1 |
|
| Laboratory: |
|
|
|
| Abstract: |
|
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. |
|
| Fulltext language: |
|
English |
|
| Production date: |
|
2008-06-06 |
|
|
| Keyword(s): |
|
finite automata – rational functions of words – sequential transducers |
|
| Comment: |
|
The results of this paper have been presented at the Journées Montoises in 2008. The proof of theorem 1 has been corrected in the following paper: Pierre-Yves Angrand, Jacques Sakarovitch: Radix enumeration of rational languages. RAIRO - Theor. Inf. and Applic. 44(1): 19-36 (2010) |
|
|
Export this paper
