Lazard's Elimination (in traces) is finite-state recognizable
Combinatorics
2016-08-16 v1
Abstract
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.
Keywords
Cite
@article{arxiv.math/0607280,
title = {Lazard's Elimination (in traces) is finite-state recognizable},
author = {Gérard Duchamp and Jean-Gabriel Luque},
journal= {arXiv preprint arXiv:math/0607280},
year = {2016}
}