A note on the languages recognized by commutative asynchronous automata (Algebraic Systems, Formal Languages and Computations)
Balázs Imreh, Masami Itō, Antal Pukler · Kyoto University Research Information Repository (Kyoto University) · 2000
The languages recognized by commutative asynchronous automata are studied and described here.It turns out that over a finite nonvoid alphabet $X$ with $|X|=k$ , the languages recognized by commutative asynchronous automata constitute such a Boolean algebra which is isomorphic to the Boolean algebra consisting of all subsets of the set $\{0,1\}^{k}$ .