2 problems

0 votes0 replies1 view
Maximal root-state-complexity conjecture for binary languages
Let $T_n$ be the full transformation monoid on an $n$ -element set, and let $U_{k,l}$ be the monoid defined above. For a language $L$ over an alphabet of size $2$ , write…
Conjectureopenfinite-automata state-complexity transformation-semigroupsarXiv posted 2 days ago
0 votes0 replies0 views
The spatially unentangled reference-state conjecture for Euler-Arnold equations
Spatially unentangled reference-state conjecture. The relevant reference state would be a state without spatial entanglement.
Conjectureopenconformal-field-theory euler-arnold-equations state-complexityarXiv posted 2 days ago

Maximal root-state-complexity conjecture for binary languages