2016/05/06 by Liang-Ting Chen, Chen, Liang-Ting, Henning Urbat +1
Computer Science · Mathematics · #Algebra over a field #Algebraic number #Algebraic structure #Characterization (materials science) #Combinatorics #Concatenation (mathematics) #FOS: Computer and information sciences #Field (mathematics) #Formal Languages and Automata Theory (cs.FL) #Geometry #Idempotence #Logic, programming, and type systems #Mathematics #Monoid #Natural Language Processing Techniques #Physics #Product (mathematics) #Pure mathematics #Type (biology) #cs.FL #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1605.01810
published in arXiv (Cornell University) (Cornell University)
arxiv created 2016/05/06 · openalex publication_date 2016/05/06 · arxiv updated 2016/05/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The Schützenberger product of monoids is a key tool for the algebraic treatment of language concatenation. In this paper we generalize the Schützenberger product to the level of monoids in an algebraic category \mathscrD, leading to a uniform view of the corresponding constructions for monoids (Schützenberger), ordered monoids (Pin), idempotent semirings (Klíma and Polák) and algebras over a field (Reutenauer). In addition, assuming that \mathscrD is part of a Stone-type duality, we derive a characterization of the languages recognized by Schützenberger products.