中文
相关论文

相关论文: The Sch\"utzenberger product for syntactic spaces

200 篇论文

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…

形式语言与自动机理论 · 计算机科学 2016-05-09 Liang-Ting Chen , Henning Urbat

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…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Mai Gehrke , Daniela Petrisan , Luca Reggio

Our main result is that any topological algebra based on a Boolean space is the extended Stone dual space of a certain associated Boolean algebra with additional operations. A particular case of this result is that the profinite completion…

逻辑 · 数学 2013-09-13 Mai Gehrke

Boolean spaces with internal semigroups generalize profinite semigroups and are pertinent for the recognition of not-necessarily regular languages. Via recognition, the study of existential quantification in logic on words amounts to the…

一般拓扑 · 数学 2019-01-18 Célia Borlido , Mai Gehrke

Stone duality establishes a contravariant equivalence between the category of Boolean algebras and the category of compact, Hausdorff, totally disconnected topological spaces (Stone spaces). These spaces are precisely the profinite spaces…

一般拓扑 · 数学 2026-01-15 J. R. Pérez-Buendía

This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…

计算机科学中的逻辑 · 计算机科学 2022-01-05 Mehdi Zaïdi

We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras.…

形式语言与自动机理论 · 计算机科学 2018-10-31 Silke Czarnetzki , Andreas Krebs , Klaus-Jörn Lange

From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…

逻辑 · 数学 2013-07-01 Steve Awodey , Henrik Forssell

The aim of the present paper is to extend the dualizing object approach to Stone duality to the non-commutative setting of skew Boolean algebras. This continues the study of non-commutative generalizations of different forms of Stone…

范畴论 · 数学 2015-03-12 Ganna Kudryavtseva

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…

形式语言与自动机理论 · 计算机科学 2019-05-02 Henning Urbat , Stefan Milius

De Vries Duality generalizes Stone duality between Boolean algebras and Stone spaces to a duality between de Vries algebras (complete Boolean algebras equipped with a subordination relation satisfying some axioms) and compact Hausdorff…

逻辑 · 数学 2022-06-28 Guillaume Massas

We develop and explore the idea of recognition of languages (in the general sense of subsets of topological algebras) as preimages of clopen sets under continuous homomorphisms into Stone topological algebras. We obtain an Eilenberg…

形式语言与自动机理论 · 计算机科学 2025-07-02 Jorge Almeida , Ondřej Klíma

We show that, if S is a finite semiring, then the free profinite S-semimodule on a Boolean Stone space X is isomorphic to the algebra of all S-valued measures on X, which are finitely additive maps from the Boolean algebra of clopens of X…

环与代数 · 数学 2020-11-19 Luca Reggio

Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…

计算机科学中的逻辑 · 计算机科学 2023-07-11 Xinghan Liu , Emiliano Lorini

We propose a novel topological perspective on data languages recognizable by orbit-finite nominal monoids. For this purpose, we introduce pro-orbit-finite nominal topological spaces. Assuming globally bounded support sizes, they coincide…

计算与语言 · 计算机科学 2024-01-17 Fabian Birkmann , Stefan Milius , Henning Urbat

We develop a uniform coalgebraic approach to J\'onsson-Tarski and Thomason type dualities for various classes of neighborhood frames and neighborhood algebras. In the first part of the paper we construct an endofunctor on the category of…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Guram Bezhanishvili , Nick Bezhanishvili , Jim de Groot

We show that finite-dimensional order unit spaces equipped with a continuous sequential product as defined by Gudder and Greechie are homogeneous and self-dual. As a consequence of the Koecher-Vinberg theorem these spaces therefore…

量子物理 · 物理学 2020-12-16 John van de Wetering

We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…

形式语言与自动机理论 · 计算机科学 2015-01-19 Jiri Adamek , Stefan Milius , Robert Myers , Henning Urbat

We establish two duality theorems which refine the classical Stone duality between generalized Boolean algebras and locally compact Boolean spaces. In the first theorem we prove that the category of left-handed skew Boolean algebras whose…

环与代数 · 数学 2015-03-18 Ganna Kudryavtseva

A common feature of many duality results is that the involved equivalence functors are liftings of hom-functors into the two-element space resp. lattice. Due to this fact, we can only expect dualities for categories cogenerated by the…

范畴论 · 数学 2017-04-03 Dirk Hofmann , Pedro Nora
‹ 上一页 1 2 3 10 下一页 ›