Direct and dual laws for automata with multiplicities
<|reference_start|>Direct and dual laws for automata with multiplicities: We present here theoretical results coming from the implementation of the package called AMULT (automata with multiplicities in several noncommutative variables). We show that classical formulas are ``almost every time'' optimal, characterize the dual laws preserving rationality and also relators that are compatible with these laws.<|reference_end|>
@article{duchamp2006direct,
    title={Direct and dual laws for automata with multiplicities},
    author={G'erard Duchamp (LIPN), Marianne Flouret (LIH EA3219), Eric
  Laugerotte (LIFAR EA2655), Jean-Gabriel Luque (IGM-LabInfo)},
    journal={Theoretical Computer Science 267 (2001) 105-120},
    year={2006},
    archivePrefix={arXiv},
    eprint={math/0607412},
    primaryClass={math.CO cs.DM cs.SC}
}