Sciweavers

Share
CORR
2008
Springer

On the decomposition of k-valued rational relations

8 years 3 months ago
On the decomposition of k-valued rational relations
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by A. Weber in 1996. Our construction is based on a lexicographic ordering of computations of automata and on two coverings that can be build by means of this ordering. The complexity of the construction, measured as the number of states of the transducers involved in the decomposition, improves the original one by one exponential.
Jacques Sakarovitch, Rodrigo de Souza
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Jacques Sakarovitch, Rodrigo de Souza
Comments (0)
books