2 problems

0 votes0 replies0 views
Finite-state recognizability conjecture for Lazard trace codes
Let $\Sigma$ be an alphabet with a reflexive and symmetric commutation relation $\vartheta$ , and let ${\rm \bf M}(\Sigma,\vartheta)$ be the associated trace monoid. Consider the tr…
Conjectureopenfactorizations finite-state-automata trace-monoidsarXiv posted 2 days ago
0 votes0 replies0 views
Least-fixed-point characterization of the star operation in the diagrammatic axiomatisation
Least-fixed-point conjecture. These copying and deleting operations force the star to be a single definite value: the least fixed point, rather than an arbitrary fixed point.
Conjectureopenfinite-state-automata fixed-points string-diagramsarXiv posted 2 days ago

Finite-state recognizability conjecture for Lazard trace codes