LAZARD'S ELIMINATION (IN TRACES) IS FINITE-STATE RECOGNIZABLE
Gérard Duchamp, Jean-Gabriel Luque · International Journal of Algebra and Computation · 2007
We prove that the codes issued from the elimination of any sub-alphabet in a trace monoid are finite-state recognizable. This implies in particular that the transitive factorizations of the trace monoids are recognizable by (boolean) finite-state automata.