Zobrazeno 1 - 1
of 1
pro vyhledávání: '"68Q45 (primary), 20C30"'
The communication matrix for two-way deterministic finite automata (2DFA) with $n$ states is defined for an automaton over a full alphabet of all $(2n+1)^n$ possible symbols: its rows and columns are indexed by strings, and the entry $(u, v)$ is $1$
Externí odkaz:
http://arxiv.org/abs/2312.05909
