A band generated by two semilattices is regular.
A basic for the type <n> hyperidentities of the medial variety of semigroups.
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
We show that the termination of Mohri's algorithm is decidable for polynomially ambiguous weighted finite automata over the tropical semiring which gives a partial answer to a question by Mohri [29]. The proof relies on an improvement of the notion of the twins property and a Burnside type characterization for the finiteness of the set of states produced by Mohri's algorithm.
A cancellative amenable ascending union of nonamenable semigroups
We construct an example of a cancellative amenable semigroup which is the ascending union of semigroups, none of which are amenable.
A certain equivalence on a semigroup
A characterezation of regular duo semigroups
A characterization of 0-minimal -ideals
A characterization of a class of semigroups.
A characterization of a free elementary semigroup.
A characterization of ...-classes of semigroups as partial groupoids.
A characterization of convolution and related operations.
A characterization of dense languages.
A characterization of dual semigroups without nilpotent ideals.
A characterization of groups in the class of *-regular semigroups.
A characterization of left cancellative monoids by flatness properties.
A characterization of rational star languages generated by strong codes.
A characterization of regular le-semigroups.
A characterization of regular monoids by flatness of left acts.
A characterization of semigroups which are semilattices of groups
A characterization of semilattices of left groups