Lazard's Elimination (in traces) is finite-state recognizable
classification
🧮 math.CO
keywords
recognizableeliminationfinite-statetraceautomatabooleancodesfactorizations
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.