Notions of automaticity in semigroups.

DOI10.1007/s002330010161zbMath1035.20045OpenAlexW2052794347MaRDI QIDQ1402893

D. Massart

Publication date: 31 August 2003

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002330010161

zbMATH Keywords

normal formsCayley graphsregular languagesautomatic groupscancellative monoidsfellow traveller propertyautomatic semigroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (18)

Automaticity of one-relator semigroups with length less than or equal to three ⋮ Automatic semigroups and categories. ⋮ Decision problems for word-hyperbolic semigroups ⋮ Notions of hyperbolicity in monoids. ⋮ 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 structures for subsemigroups of Baumslag-Solitar semigroups. ⋮ Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. ⋮ On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids ⋮ Finite transducers for divisibility monoids ⋮ Uniform decision problems for automatic semigroups. ⋮ DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS ⋮ Properties of the subsemigroups of the bicyclic monoid ⋮ MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS ⋮ On the automaticity of singular Artin monoids of finite type ⋮ Automatic semigroup acts.

This page was built for publication: Notions of automaticity in semigroups.