The kernel of monoid morphisms

Asymptotic properties of free monoid morphisms

Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word w = g(f(a)) is the image of a fixed point of a morphism f under another morphism g, then there exist a non-erasing morphism σ and a coding τ such that w = τ (σ(b)). Based on the ...

The kernel of a monoid morphism

Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata

Automata theory has played an important role in theoretical computer science since last couple of decades. The algebraic automaton has emerged with several modern applications, for example, optimization of programs, design of model checkers, development of theorem provers because of having certain interesting properties and structures from algebraic theory of mathematics. Design of a complex sy...

The category of monoid actions in Cpo

In this paper, some categorical properties of the category ${bf Cpo}_{{bf Act}text{-}S}$ of all {cpo $S$-acts}, cpo's equipped with actions of a monoid $S$ on them, and strict continuous action-preserving maps between them is considered. In particular, we describe products and coproducts in this category, and consider monomorphisms and epimorphisms. Also, we show that the forgetful functor from...

Commutative images of rational languages and the Abelian kernel of a monoid