Automaticity and commutative semigroups
From MaRDI portal
Publication:4531397
DOI10.1017/S0017089502010121zbMath1004.20036OpenAlexW2002412015MaRDI QIDQ4531397
No author found.
Publication date: 7 November 2002
Published in: Glasgow Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0017089502010121
Formal languages and automata (68Q45) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (11)
An automatic semigroup of languages ⋮ Automaticity of one-relator semigroups with length less than or equal to three ⋮ Automatic semigroups and categories. ⋮ A geometric characterization of automatic semigroups ⋮ Automatic structure for generalized Bruck-Reilly ∗-extension of a monoid ⋮ A note on automatic semigroups. ⋮ Automatic structures for semigroup constructions. ⋮ ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES ⋮ Uniform decision problems for automatic semigroups. ⋮ Subsemigroups of groups: presentations, Malcev presentations, and automatic structures ⋮ Quasi-automatic groups are asynchronously automatic
This page was built for publication: Automaticity and commutative semigroups
