Notions of automaticity in semigroups.
The authors investigate the natural question of extending the notion of `automatic group' to `automatic semigroup'. They introduce four different definitions of automaticity in semigroups which are equivalent for groups. These four definitions arise when they consider which side (left or right) they choose for multiplication by generators and which side (left or right) they choose for padding pairs of strings of unequal length. The authors then demonstrate, via a sequence of examples, that their four definitions of automatic semigroup are truly independent. They further point out that there is some relationship between them in the cancellative monoid case. The authors also give properties of the four resulting classes of semigroups.
- A semigroup approach to automaticity
- Automatic semigroups
- Green index in semigroups: generators, presentations, and automatic structures.
- 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.
- Automaticity of one-relator semigroups with length less than or equal to three
- Automatic semigroups and categories.
- Automatic Rees matrix semigroups over categories.
- Automatic structures for subsemigroups of Baumslag-Solitar semigroups.
- Finite transducers for divisibility monoids
- Uniform decision problems for automatic semigroups.
- Automaticity of a Clifford semigroup
- On the automaticity of singular Artin monoids of finite type.
- Decision problems for word-hyperbolic semigroups
- CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
- Automatic Presentations for Cancellative Semigroups
- Properties of the subsemigroups of the bicyclic monoid
- MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
- Automaticity and commutative semigroups
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
- Automatic semigroups vs automaton semigroups
- Automaton semigroups: new constructions results and examples of non-automaton semigroups
- Semi-groupes fortement automatiques.
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
- Fundamentals of Computation Theory
- Geometric properties and asynchronously automatic semigroups.
- Computing automorphisms of semigroups.
- Notions of hyperbolicity in monoids.
- A geometric characterization of automatic semigroups
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)
