Lazard's Elimination (in traces) is finite-state recognizable
  We prove that the codes issued from the elimination of any subalphabet 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. 
G\'erard Duchamp (LIPN), Jean-Gabriel Luque (IGM-LabInfo)