Automaticity and commutative semigroups
From MaRDI portal
Publication:4531397
Recommendations
Cited in
(19)- Automatic structure for generalized Bruck-Reilly \(*\)-extension of a monoid
- CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
- scientific article; zbMATH DE number 3877253 (Why is no real title available?)
- Quasi-automatic groups are asynchronously automatic
- Automatic semigroups and categories.
- Subsemigroups of groups: presentations, Malcev presentations, and automatic structures
- Quasi-automatic semigroups
- Finitely generated semiautomatic groups
- Finitely generated semiautomatic groups
- 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
- 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)