Lazard's Elimination (in traces) is finite-state recognizable

Gérard Henry Edmond Duchamp (1) , Jean-Gabriel Luque (2)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 LIGM - Laboratoire d'Informatique Gaspard-Monge

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.

Domaines: Combinatoire [math.CO]

Gérard Henry Edmond Duchamp, Jean-Gabriel Luque. Lazard's Elimination (in traces) is finite-state recognizable. 2006. ⟨hal-00084721v2⟩