Markov semigroups, monoids and groups.
From MaRDI portal
Publication:2923337
Abstract: A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating set. This paper considers the natural generalizations of these concepts to semigroups and monoids. Two distinct potential generalizations to monoids are shown to be equivalent. Various interesting examples are presented, including an example of a non-Markov monoid that nevertheless admits a regular language of unique representatives over any generating set. It is shown that all finitely generated commutative semigroups are strongly Markov, but that finitely generated subsemigroups of virtually abelian or polycyclic groups need not be. Potential connections with word-hyperbolic semigroups are investigated. A study is made of the interaction of the classes of Markov and strongly Markov semigroups with direct products, free products, and finite-index subsemigroups and extensions. Several questions are posed.
Recommendations
- Semigroups, rings, and Markov chains
- scientific article; zbMATH DE number 6525973
- scientific article; zbMATH DE number 2069981
- scientific article; zbMATH DE number 2039031
- scientific article; zbMATH DE number 2144722
- scientific article; zbMATH DE number 5993931
- scientific article; zbMATH DE number 2006036
- Markov processes, semigroups and generators.
- Hyperaction of semigroups and monoids.
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1438385 (Why is no real title available?)
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
- A finiteness condition for rewriting systems
- A short proof of Rédei's theorem
- AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX
- Automatic monoids and change of generators
- Automatic presentations for semigroups.
- Automatic semigroups
- CAYLEY AUTOMATON SEMIGROUPS
- Commutative monoids have complete presentations by free (non-commutative) monoids
- Context-free rewriting systems and word-hyperbolic structures with uniqueness
- Finitely presented monoids with linear Dehn function need not have regular cross-sections.
- Generators and relations of direct products of semigroups
- Green index and finiteness conditions for semigroups.
- Green index in semigroups: generators, presentations, and automatic structures.
- Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
- Malcev presentations for subsemigroups of direct products of coherent groups.
- Minimal length normal forms for some soluble groups
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- On monoids presented by a single relation
- On problems related to growth, entropy, and spectrum in group theory
- Rational and transcendental growth series for the higher Heisenberg groups
- Regular geodesic normal forms in virtually Abelian groups
- Remarks concerning finitely generated semigroups having regular sets of unique normal forms
- Syntactic and Rees indices of subsemigroups
- Uniform decision problems for automatic semigroups.
- Word hyperbolic semigroups
Cited in
(4)
This page was built for publication: Markov semigroups, monoids and groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2923337)
