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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
