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.
Publié le : 2001-07-05
Classification:
Automata with multiplicities,
rational laws,
dual laws,
congruences,
shuffle compatibility,
[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS],
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
@article{hal-00085316,
author = {Duchamp, G\'erard, and Flouret, Marianne and Laugerotte, Eric and Luque, Jean-Gabriel},
title = {Direct and dual laws for automata with multiplicities},
journal = {HAL},
volume = {2001},
number = {0},
year = {2001},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-00085316}
}
Duchamp, Gérard, ; Flouret, Marianne; Laugerotte, Eric; Luque, Jean-Gabriel. Direct and dual laws for automata with multiplicities. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-00085316/