English
Related papers

Related papers: Sch\"utzenberger Products in a Category

200 papers

Starting from Boolean algebras of languages closed under quotients and using duality theoretic insights, we derive the notion of Boolean spaces with internal monoids as recognisers for arbitrary formal languages of finite words over finite…

Logic in Computer Science · Computer Science 2016-03-29 Mai Gehrke , Daniela Petrisan , Luca Reggio

The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the…

Logic in Computer Science · Computer Science 2023-06-22 Jiří Adamek , Stefan Milius , Henning Urbat

The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids…

Logic in Computer Science · Computer Science 2015-06-17 Jiri Adamek , Stefan Milius , Henning Urbat

Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids. In the present paper this result is generalized to an abstract…

Formal Languages and Automata Theory · Computer Science 2015-01-22 Jiri Adamek , Stefan Milius , Robert Myers , Henning Urbat

In this paper we introduce the Sch\"utzenberger category $\mathbb D(S)$ of a semigroup $S$. It stands in relation to the Karoubi envelope (or Cauchy completion) of $S$ in the same way that Sch\"utzenberger groups do to maximal subgroups and…

Group Theory · Mathematics 2014-08-08 Alfredo Costa , Benjamin Steinberg

In this paper we continue a classical work of Sch\"utzenberger on codes with bounded synchronization delay. He was interested to characterize those regular languages where the groups in the syntactic monoid belong to a variety $H$. He…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Volker Diekert , Tobias Walter

We prove that the class of finitely presented inverse monoids whose Sch\"utzenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the languages of their Sch\"utzenberger automata are context-free.…

Group Theory · Mathematics 2022-11-18 Robert D. Gray , Pedro V. Silva , Nóra Szakács

In this paper we give a partial answer to the problem which is about the regularity of Schutzenberger products in semigroups asked by Gallagher in his thesis [Problem 6.1.6]{Gallagher} and, also, we investigate the regularity for the new…

Group Theory · Mathematics 2008-04-01 Firat Ates , Ahmet Sinan Cevik

In the setting of product systems over group-embeddable monoids, we consider nuclearity of the associated Toeplitz C*-algebra in relation to nuclearity of the coefficient algebra. Our work goes beyond the known cases of single…

Operator Algebras · Mathematics 2025-08-27 Elias G. Katsoulis , Marcelo Laca , Camila F. Sehnem

We study the language-theoretic aspects of the word problem, in the sense of Duncan & Gilman, of free products of semigroups and monoids. First, we provide algebraic tools for studying classes of languages known as super-AFLs, which…

Group Theory · Mathematics 2021-12-21 Carl-Fredrik Nyberg-Brodda

This paper contributes to the techniques of topo-algebraic recognition for languages beyond the regular setting as they relate to logic on words. In particular, we provide a general construction on recognisers corresponding to adding one…

Logic in Computer Science · Computer Science 2023-06-22 Mai Gehrke , Daniela Petrisan , Luca Reggio

The scientific and practical needs of the twenty-first century lead humankind to convergence of the specialized and diverse branches of science and technology. This convergence reveals the need for new mathematical theories capable of…

Category Theory · Mathematics 2018-12-20 Aydin Manzouri

We establish an Eilenberg-type correspondence for data languages, i.e. languages over an infinite alphabet. More precisely, we prove that there is a bijective correspondence between varieties of languages recognized by orbit-finite nominal…

Formal Languages and Automata Theory · Computer Science 2019-05-02 Henning Urbat , Stefan Milius

We study the variety ZG of monoids where the elements that belong to a group are central, i.e., commute with all other elements. We show that ZG is local, that is, the semidirect product ZG * D of ZG by definite semigroups is equal to LZG,…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Antoine Amarilli , Charles Paperman

A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…

Group Theory · Mathematics 2023-09-06 Igor Dolinka , Robert D. Gray

We characterize, in terms of elementary properties, the abelian monoids which are direct limits of finite direct sums of monoids of the form $(Z/nZ)\sqcup\{0\}$ (where 0 is a new zero element), for positive integers $n$. The key properties…

Operator Algebras · Mathematics 2007-05-23 K. R. Goodearl , E. Pardo , F. Wehrung

The monoid of multipliers of a semigroup object in a monoidal category is introduced, arising from an abstraction of the definition of the translational hull of an ordinary semigroup or of the multiplier algebra of a Banach algebra and…

Category Theory · Mathematics 2022-07-08 Laurent Poinsot

Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…

Combinatorics · Mathematics 2026-04-08 Samuele Giraudo

Every small monoidal category with universal finite joins of central idempotents is monoidally equivalent to the category of global sections of a sheaf of local monoidal categories on a topological space. Every small stiff monoidal category…

Category Theory · Mathematics 2023-02-09 Rui Soares Barbosa , Chris Heunen

We generalise classical reconstruction results in algebra, using the language of monads, monoidal categories, module categories, as well as various notions of duality, such as closedness, Grothendieck--Verdier duality (also known as…

Category Theory · Mathematics 2026-02-24 Tony Zorman
‹ Prev 1 2 3 10 Next ›