Automatic monoids and change of generators

DOI10.1017/S0305004199003722zbMath0941.20065OpenAlexW1987561876MaRDI QIDQ4934090

No author found.

Publication date: 17 May 2000

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004199003722

zbMATH Keywords

generating setsfinite automataregular languagesautomatic structuresautomatic monoidsfree products of monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (27)

AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX ⋮ An automatic semigroup of languages ⋮ Automaticity of one-relator semigroups with length less than or equal to three ⋮ Automatic semigroups and categories. ⋮ 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}\) ⋮ Decision problems for word-hyperbolic semigroups ⋮ A geometric characterization of automatic semigroups ⋮ Markov semigroups, monoids and groups ⋮ Quasi-automatic semigroups ⋮ Automatic semigroups and Bruck-Reilly extensions. ⋮ The monoid of queue actions ⋮ A note on automatic semigroups. ⋮ Automatic structures for subsemigroups of Baumslag-Solitar semigroups. ⋮ Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. ⋮ Remarks concerning finitely generated semigroups having regular sets of unique normal forms ⋮ Quasi-automatic semigroups ⋮ Automatic structures for semigroup constructions. ⋮ Automatic subsemigroups of free products. ⋮ On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids ⋮ Uniform decision problems for automatic semigroups. ⋮ MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS ⋮ Quasi-automatic groups are asynchronously automatic ⋮ Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids ⋮ Automatic semigroups ⋮ Extensions and submonoids of automatic monoids. ⋮ Automatic semigroup acts. ⋮ On graph products of automatic monoids

This page was built for publication: Automatic monoids and change of generators