Markov semigroups, monoids and groups
From MaRDI portal
Publication:2923337
DOI10.1142/S021819671450026XzbMath1325.20055arXiv1202.3013OpenAlexW2000596726MaRDI QIDQ2923337
Publication date: 15 October 2014
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.3013
Markov semigroupsrewriting systemsregular languagesfinite generating setsnormal form theoremsprefix-closed languagesMarkov monoidsword hyperbolic semigroups
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (2)
Two applications of monoid actions to cross-sections ⋮ Finitely presented monoids with linear Dehn function need not have regular cross-sections.
Cites Work
- Unnamed Item
- Unnamed Item
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
- Green index and finiteness conditions for semigroups.
- Malcev presentations for subsemigroups of direct products of coherent groups.
- Automatic presentations for semigroups.
- Commutative monoids have complete presentations by free (non-commutative) monoids
- A short proof of Rédei's theorem
- On monoids presented by a single relation
- Syntactic and Rees indices of subsemigroups
- Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
- A finiteness condition for rewriting systems
- Automatic semigroups
- Rational and transcendental growth series for the higher Heisenberg groups
- Green index in semigroups: generators, presentations, and automatic structures.
- On problems related to growth, entropy, and spectrum in group theory
- Finitely presented monoids with linear Dehn function need not have regular cross-sections.
- Uniform decision problems for automatic semigroups.
- Remarks concerning finitely generated semigroups having regular sets of unique normal forms
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- CAYLEY AUTOMATON SEMIGROUPS
- Generators and relations of direct products of semigroups
- Regular geodesic normal forms in virtually Abelian groups
- AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX
- Word hyperbolic semigroups
- CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS
- Automatic monoids and change of generators
- Minimal length normal forms for some soluble groups
This page was built for publication: Markov semigroups, monoids and groups
