Papers
Topics
Authors
Recent
Search
2000 character limit reached

Schützenberger Products in a Category

Published 6 May 2016 in cs.FL | (1605.01810v1)

Abstract: The Sch\"utzenberger product of monoids is a key tool for the algebraic treatment of language concatenation. In this paper we generalize the Sch\"utzenberger product to the level of monoids in an algebraic category $\mathscr{D}$, leading to a uniform view of the corresponding constructions for monoids (Sch\"utzenberger), ordered monoids (Pin), idempotent semirings (Kl\'ima and Pol\'ak) and algebras over a field (Reutenauer). In addition, assuming that $\mathscr{D}$ is part of a Stone-type duality, we derive a characterization of the languages recognized by Sch\"utzenberger products.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.