Direct and dual laws for automata with multiplicities
Combinatorics
2016-08-16 v1 Discrete Mathematics
Symbolic Computation
Abstract
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.
Cite
@article{arxiv.math/0607412,
title = {Direct and dual laws for automata with multiplicities},
author = {Gérard Duchamp and Marianne Flouret and Eric Laugerotte and Jean-Gabriel Luque},
journal= {arXiv preprint arXiv:math/0607412},
year = {2016}
}