Reducing Cover Subsequential Transducers
Jean-Marc Champarnaud, Franck Guingne, Georges Hansel
Cover automata were introduced a few years ago for designing a compact representation of finite languages. Our aim is to extend this notion to cover transducers with funcion for finite domain.
Descriptional Complexity of Formal Systems. 6th workshop, London, Ontario, Canada, July 26-28, 2004.