Automatic monoids and change of generators
From MaRDI portal
Recommendations
Cited in
(29)- Automatic semigroups
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)
- The monoid of queue actions
- Extensions and submonoids of automatic monoids.
- Automatic semigroups and Bruck-Reilly extensions.
- A note on automatic semigroups.
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
- Quasi-automatic groups are asynchronously automatic
- Automatic semigroup acts.
- An automatic semigroup of languages
- Automaticity of one-relator semigroups with length less than or equal to three
- Automatic semigroups and categories.
- Quasi-automatic semigroups
- Automatic structures for subsemigroups of Baumslag-Solitar semigroups.
- Automatic structures for semigroup constructions.
- Automatic subsemigroups of free products.
- On graph products of automatic and biautomatic monoids.
- Uniform decision problems for automatic semigroups.
- Remarks concerning finitely generated semigroups having regular sets of unique normal forms
- Markov semigroups, monoids and groups.
- Decision problems for word-hyperbolic semigroups
- On graph products of automatic monoids
- MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
- A Geometric Characterization of Automatic Monoids
- AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
- Quasi-automatic semigroups
- Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids.
- A geometric characterization of automatic semigroups
This page was built for publication: Automatic monoids and change of generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934090)
