Irreducibility of Semigroup Morphisms
Formal Languages and Automata Theory
2026-03-17 v1
Abstract
We study the notion of irreducibility of semigroup morphisms. Given an alphabet , a morphism is irreducible if any factorisation can only be satisfied if or is a trivial morphism. Otherwise, is reducible. We introduce the notion of irreducibility, characterise this property and study a number of fundamental questions on the concepts under consideration.
Cite
@article{arxiv.2603.15177,
title = {Irreducibility of Semigroup Morphisms},
author = {Paul C. Bell and Eva Foster and Daniel Reidenbach},
journal= {arXiv preprint arXiv:2603.15177},
year = {2026}
}