Automatic monoids and change of generators

From MaRDI portal





An automatic structure of a monoid \(M\) is an ordered pair \((A,L)\), where \(A\) is a generating set of \(M\) and \(L\) is a regular (i.e., acceptable by a finite automaton) language over the alphabet \(A\), which fulfills certain conditions. If \(M\) has an automatic structure, it is called an automatic monoid. The main results are the following: Theorem 1.1. Let \(M\) be a monoid with automatic structure \((A,L)\) and let \(B\) be a finite generating set for \(M\). Then there exists an automatic structure \((B,K)\) for \(M\). Theorem 1.2. Let \(M=N_1*N_2\) be the free product of monoids \(N_1\) and \(N_2\). If \(M\) is automatic, then \(N_i\) is automatic for \(i=1,2\).




Cited in
(29)








This page was built for publication: Automatic monoids and change of generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934090)