2019/07/02 by Ashley Clayton, Clayton, Ashley
Computer Science · Mathematics · #Advanced Algebra and Logic #Combinatorics (math.CO) #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1907.01378
openalex publication_date 2019/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider necessary and sufficient conditions for finite generation and finite presentability for fiber products of free semigroups and free monoids. We give a necessary and sufficient condition on finite fiber quotients for a fiber product of two free monoids to be finitely generated, and show that all such fiber products are also finitely presented. By way of contrast, we show that fiber products of free semigroups over finite fiber quotients are never finitely generated. We then consider fiber products of free semigroups over infinite semigroups, and show that for such a fiber product to be finitely generated, the quotient must be infinite but finitely generated, idempotent-free, and J-trivial. Finally, we construct automata accepting the indecomposable elements of the fiber product of two free monoids/semigroups over free monoid/semigroup fibers, and give a necessary and sufficient condition for such a product to be finitely generated.