Tullio Ceccherini-Silberstein, Michel Coornaert, Xuan Kien Phung
Abstract
A monoid is said to be surjunctive if every injective cellular automaton with finite alphabet over is surjective. We show that monoid algebras of surjunctive monoids are stably finite. In other words, given any field and any surjunctive monoid , every one-sided invertible square matrix with entries in the monoid algebra is two-sided invertible. Our proof uses first-order model theory.