Automatic semigroups and Bruck-Reilly extensions.
From MaRDI portal
Publication:1945251
DOI10.1007/s10474-009-8063-8zbMath1259.20061MaRDI QIDQ1945251
Publication date: 5 April 2013
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10474-009-8063-8
68Q45: Formal languages and automata
20M05: Free semigroups, generators and relations, word problems
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Automatic structure for generalized Bruck-Reilly ∗-extension of a monoid, A note on automatic semigroups., Automatic presentations and semigroup constructions, Automatic semigroup acts.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of automaticity in semigroups.
- Automatic semigroups
- Automatic completely-simple semigroups
- Automatic structures for semigroup constructions.
- FINITE PRESENTABILITY OF BRUCK–REILLY EXTENSIONS OF CLIFFORD MONOIDS
- A Geometric Characterization of Automatic Monoids
- Automatic monoids and change of generators
- Subsemigroups of groups: presentations, Malcev presentations, and automatic structures
- Finite Presentability of Bruck–Reilly Extensions of Semilattices
- Fundamentals of Computation Theory
- Finite presentability of Bruck-Reilly extensions of groups