Notions of automaticity in semigroups.

DOI10.1007/S002330010161MaRDI QIDQ1402893zbMATH OpenOpenAlexFDO

Authors 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

Cayley graphsnormal formsregular languagesautomatic groupscancellative monoidsfellow traveller propertyautomatic semigroups

Mathematics Subject Classification ID

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

Recommendations

• Automatic semigroups
• Automatic subsemigroups of free products.
• A note on automatic semigroups.
• Quasi-automatic semigroups
• Fundamentals of Computation Theory

Cited in

(32)

• MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
• A note on automatic semigroups.
• Automaticity and commutative semigroups
• Computing automorphisms of semigroups.
• Quasi-automatic groups are asynchronously automatic
• Automatic semigroups and Bruck-Reilly extensions.
• Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
• On the automaticity of singular Artin monoids of finite type.
• Automatic Presentations for Cancellative Semigroups
• A semigroup approach to automaticity
• Automatic semigroups and categories.
• On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
• Automatic semigroup acts.
• Automaticity of one-relator semigroups with length less than or equal to three
• Uniform decision problems for automatic semigroups.
• Automatic Rees matrix semigroups over categories.
• Properties of the subsemigroups of the bicyclic monoid
• Semi-groupes fortement automatiques.
• Automatic structures for subsemigroups of Baumslag-Solitar semigroups.
• Finite transducers for divisibility monoids
• Fundamentals of Computation Theory
• CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
• Automaticity of a Clifford semigroup
• Automatic semigroups vs automaton semigroups
• Decision problems for word-hyperbolic semigroups
• Geometric properties and asynchronously automatic semigroups.
• Notions of hyperbolicity in monoids.
• Green index in semigroups: generators, presentations, and automatic structures.
• A geometric characterization of automatic semigroups
• Automaton semigroups: new constructions results and examples of non-automaton semigroups
• Automatic semigroups
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS

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

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