2 problems

0 votes0 replies0 views
Sharp distinction between expansive and abelian expansive networks
Let $q$ be an alphabet size, and let $E[D,q]$ denote the set of expansive networks on a digraph $D$ over an alphabet of size $q$ , while $EA[D,q]$ denotes the set of abelian expansi…
Conjectureopenautomata-networks discrete-dynamics graph-theoryarXiv posted 2 days ago
0 votes0 replies0 views
The lower bound conjecture for simulation time of universal transformations
Universal-transformation lower-bound conjecture. Any $n$ -universal transformation has maximal simulation time at least
Conjectureopenautomata-networks computational-complexity finite-algebraic-systemsarXiv posted 2 days ago

Sharp distinction between expansive and abelian expansive networks