Automatic completely-simple semigroups
From MaRDI portal
Publication:1848173
DOI10.1023/A:1015632704977zbMath0997.20050MaRDI QIDQ1848173
Nikola Ruškuc, Edmund F. Robertson, Colin M. Campbell, Richard M. Thomas
Publication date: 3 November 2002
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
completely simple semigroupsRees matrix semigroupsfinitely presented semigroupsregular languagesautomatic groupsautomatic semigroups
Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (15)
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 ⋮ Green index in semigroups: generators, presentations, and automatic structures. ⋮ Automatic semigroups and Bruck-Reilly extensions. ⋮ A note on automatic semigroups. ⋮ Automatic presentations and semigroup constructions ⋮ Homological finiteness properties of monoids, their ideals and maximal subgroups. ⋮ Automatic structures for semigroup constructions. ⋮ ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES ⋮ Uniform decision problems for automatic semigroups. ⋮ Automatic semigroups ⋮ Extensions and submonoids of automatic monoids. ⋮ Automatic semigroup acts.
This page was built for publication: Automatic completely-simple semigroups
