English

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 Σ\Sigma, a morphism φ:Σ+Σ+\varphi:\Sigma^+\rightarrow\Sigma^+ is irreducible if any factorisation φ=ψ2ψ1\varphi=\psi_2\circ\psi_1 can only be satisfied if ψ1\psi_1 or ψ2\psi_2 is a trivial morphism. Otherwise, φ\varphi is reducible. We introduce the notion of irreducibility, characterise this property and study a number of fundamental questions on the concepts under consideration.

Keywords

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}
}
R2 v1 2026-07-01T11:22:08.758Z