We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other. We also give necessary and sufficient conditions for these lattices to have maximal possible complexity.Comment: In Proceedings AFL 2023, arXiv:2309.0112
It has been a long-standing open problem to construct a general framework for relating the spectra o...
Abstract. An atom of a regular language L with n (left) quotients is a non-empty intersection of unc...
AbstractWe give necessary and sufficient conditions for a lattice of finite length to be dually atom...
Best paper award of ICALP 2008, Track BInternational audienceThis paper presents a new result in the...
International audienceThe natural join and the inner union combine in different ways tables of a rel...
The final publication is available at Elsevier via http://dx.doi.org/10.1016/j.tcs.2012.10.055 © 201...
International audienceThe natural join and the inner union combine in different ways tables of a rel...
International audienceWe establish a formal connection between algorithmic correspondence theory and...
A language L over an alphabet Σ is a right (left) ideal if it satisfies L = LΣ∗ (L = Σ∗L). It is a t...
AbstractThe purpose of this note is to prove the duality of several pairs of categories of complete ...
A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, ...
A language L over an alphabet Σ is prefix-convex if, for any words x, y, z ϵ Σ* , whenever x and xyz...
This thesis focuses on graphs, hypergraphs, and lattices. We study the complexity of the dualization...
AbstractWe make a study of lattices representable by commuting equivalence relations, which we call ...
summary:This paper aims to propose a complete relational semantics for the so-called logic of bounde...
It has been a long-standing open problem to construct a general framework for relating the spectra o...
Abstract. An atom of a regular language L with n (left) quotients is a non-empty intersection of unc...
AbstractWe give necessary and sufficient conditions for a lattice of finite length to be dually atom...
Best paper award of ICALP 2008, Track BInternational audienceThis paper presents a new result in the...
International audienceThe natural join and the inner union combine in different ways tables of a rel...
The final publication is available at Elsevier via http://dx.doi.org/10.1016/j.tcs.2012.10.055 © 201...
International audienceThe natural join and the inner union combine in different ways tables of a rel...
International audienceWe establish a formal connection between algorithmic correspondence theory and...
A language L over an alphabet Σ is a right (left) ideal if it satisfies L = LΣ∗ (L = Σ∗L). It is a t...
AbstractThe purpose of this note is to prove the duality of several pairs of categories of complete ...
A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, ...
A language L over an alphabet Σ is prefix-convex if, for any words x, y, z ϵ Σ* , whenever x and xyz...
This thesis focuses on graphs, hypergraphs, and lattices. We study the complexity of the dualization...
AbstractWe make a study of lattices representable by commuting equivalence relations, which we call ...
summary:This paper aims to propose a complete relational semantics for the so-called logic of bounde...
It has been a long-standing open problem to construct a general framework for relating the spectra o...
Abstract. An atom of a regular language L with n (left) quotients is a non-empty intersection of unc...
AbstractWe give necessary and sufficient conditions for a lattice of finite length to be dually atom...