Results 21 to 30 of about 87 (62)
International audienceA monoid M is called surjunctive if every injective cellular automata with finite alphabet over M is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all ...
Ceccherini-Silberstein, Tullio +1 more
core +1 more source
Finiteness properties for semigroups and their substructures [PDF]
In this thesis we consider finiteness properties of infinite semigroups and infinite monoids. In particular we investigate finite presentations which have the property finite derivation type (FDT) or the property that they admit a presentation by a finite ...
Lubbock, Diane
core
On semitopological $\alpha$-bicyclic monoid
In this paper we consider a semitopological $\alpha$-bicyclic monoid $\mathcal{B}_{\alpha}$ and prove that it is algebraically isomorphic to a semigroup of all order isomorphisms between the principal upper sets of the ordinal $\omega^\alpha$. We prove that for every ordinal $\alpha$ for every $(a,b)\in \mathcal{B_\alpha}$ if either $a$ or $b$ is a non-
openaire +2 more sources
Rational monoid and semigroup automata [PDF]
We consider a natural extension to the definition of M-automata which allows the automaton to make use of more of the structure of the monoid M, and by removing the reliance on an identity element, allows the definition of S-automata for S an arbitrary ...
Render, Elaine +2 more
core
Rational subsets of polycyclic monoids and valence automata
We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids.
Render, Elaine, Kambites, Mark
core +1 more source
GENERALIZED GREEN’S EQUIVALENCES ON THE SUBSEMIGROUPS OF THE BICYCLIC MONOID
We study generalized Green’s equivalences on all subsemigroups of the bicyclic monoid B and determine the abundant (and adequate) sub-semigroups of B.
P. M. Higgins, L. Descalço
core
A bisimple inverse monoid of quadruples of non-negative integers. The Möbius function
The additive monoid of non-negative integers $\mathbb{N}$ is isomorphic to the right unit submonoid of the (bisimple) bicyclic semigroup $B=\mathbb{N}×\mathbb{N}$.
Schwab, Emil Daniel
core +1 more source
Conjugacy in inverse semigroups [PDF]
The first and second authors were partially supported by the Fundacao para a Ciencia e a Tecnologia (Portuguese Foundation for Science and Technology) through the project UID/MAT/00297/2019 (Centro de Matematica e Aplicacoes), the project PTDC/MHC-FIL ...
Kinyon, Michael +6 more
core +1 more source
Automatic semigroups vs automaton semigroups [PDF]
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a language of greedy ...
Picantin, Matthieu
core +1 more source
The structure of the algebra K[M] of the Chinese monoid M over a field K is studied. The minimal prime ideals are described. They are determined by certain homogeneous congruences on M and they are in a one to one correspondence with diagrams of certain ...
Jaszuńska, Joanna +3 more
core +1 more source

