Related papers: Markov semigroups, monoids, and groups
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids…
Generators of Markov processes on a countable state space can be represented as finite or infinite matrices. One key property is that the off-diagonal entries corresponding to jump rates of the Markov process are non-negative. Here we…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…
We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…
We present and explore a general method for deriving a Lie-Markov model from a finite semigroup. If the degree of the semigroup is $k$, the resulting model is a continuous-time Markov chain on $k$ states and, as a consequence of the product…
If $\mathcal{C}$ is a category of algebras closed under finite direct products, and $M_\mathcal{C}$ the commutative monoid of isomorphism classes of members of $\mathcal{C},$ with operation induced by direct product, A.Tarski defined a…
We show that for any monoid M, the family of languages accepted by M-automata (or equivalently, generated by regular valence grammars over M) is completely determined by that part of M which lies outside the maximal ideal. Hence, every such…
We study the language-theoretic aspects of the word problem, in the sense of Duncan & Gilman, of free products of semigroups and monoids. First, we provide algebraic tools for studying classes of languages known as super-AFLs, which…
A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…
The aim of this paper is to solve a problem proposed by Dominique Bourn: to provide a categorical-algebraic characterisation of groups amongst monoids and of rings amongst semirings. In the case of monoids, our solution is given by the…
We give a complete characterization of pseudovarieties of semigroups whose finitely generated relatively free profinite semigroups are equidivisible. Besides the pseudovarieties of completely simple semigroups, they are precisely the…
We study the generic properties of finitely presented monoids and semigroups. We show that for positive integers a > 1, k and m, the generic a-generator k-relation monoid and semigroup presentation (defined in any of several definite…
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…
It is a classical result that the direct product AxB of two groups is finitely generated (finitely presented) if and only if A and B are both finitely generated (finitely presented). This is also true for direct products of monoids, but not…
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite…
We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and…
We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…