Automatic structures for semigroup constructions.
From MaRDI portal
Publication:2481327
DOI10.1007/S00233-007-9026-4zbMATH Open1142.20036arXivmath/0703190OpenAlexW2026891756MaRDI QIDQ2481327FDOQ2481327
Authors: Yanyan Li 
Publication date: 9 April 2008
Published in: Semigroup Forum (Search for Journal in Brave)
Abstract: We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix semigroups, Bruck-Reilly extensions and wreath products.
Full work available at URL: https://arxiv.org/abs/math/0703190
Recommendations
Free semigroups, generators and relations, word problems (20M05) General structure theory for semigroups (20M10) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimple ω-Semigroups
- Title not available (Why is that?)
- On diagonal acts of monoids
- Automatic semigroups
- Automatic monoids and change of generators
- Automatic groups and amalgams
- SUBSEMIGROUPS OF THE BICYCLIC MONOID
- Title not available (Why is that?)
- Generators and relations of direct products of semigroups
- ON FINITE GENERATION AND OTHER FINITENESS CONDITIONS FOR WREATH PRODUCTS OF SEMIGROUPS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite generation and presentability of wreath products of monoids.
- AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX
- Automatic completely-simple semigroups
- Title not available (Why is that?)
- Finite presentability of Bruck-Reilly extensions of groups
- Title not available (Why is that?)
- On simple inverse semigroups
- Automaticity and commutative semigroups
- A Geometric Characterization of Automatic Monoids
- Automatic design error correction of combinatorial circuits
Cited In (11)
- Automatic semigroups and Bruck-Reilly extensions.
- Automaton semigroup constructions.
- Automatic completely-simple semigroups
- Automatic Presentations for Cancellative Semigroups
- Title not available (Why is that?)
- Automatic semigroup acts.
- FINITE PRESENTABILITY OF SEMIGROUP CONSTRUCTIONS
- Automatic Rees matrix semigroups over categories.
- Automatic structure for generalized Bruck-Reilly ∗-extension of a monoid
- Quasi-automatic semigroups
- Automatic presentations and semigroup constructions
This page was built for publication: Automatic structures for semigroup constructions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481327)
