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