Automaticity and commutative semigroups

DOI10.1017/S0017089502010121zbMATH Open1004.20036OpenAlexW2002412015MaRDI QIDQ4531397FDOQ4531397

Authors:

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

Recommendations

• Notions of automaticity in semigroups.
• Automatic semigroups
• A note on automatic semigroups.
• Automatic completely-simple semigroups
• An automatic semigroup of languages

zbMATH Keywords

automatic semigroupsfinitely presented commutative semigroups

Mathematics Subject Classification ID

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

Cited In (17)

• CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
• Title not available (Why is that?)
• Quasi-automatic groups are asynchronously automatic
• Automatic semigroups and categories.
• Subsemigroups of groups: presentations, Malcev presentations, and automatic structures
• Quasi-automatic semigroups
• An automatic semigroup of languages
• Automaticity of one-relator semigroups with length less than or equal to three
• Automatic Rees matrix semigroups over categories.
• A GROUP-EMBEDDABLE NON-AUTOMATIC SEMIGROUP WHOSE UNIVERSAL GROUP IS AUTOMATIC
• Automatic semigroups
• Automatic structure for generalized Bruck-Reilly ∗-extension of a monoid
• On the structure of finitely generated semigroups of unary regular languages
• A geometric characterization of automatic semigroups
• A note on automatic semigroups.
• Uniform decision problems for automatic semigroups.
• Automatic structures for semigroup constructions.

This page was built for publication: Automaticity and commutative semigroups

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