English
Related papers

Related papers: Free Kleene algebras with domain

200 papers

We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…

Formal Languages and Automata Theory · Computer Science 2024-10-09 Damien Pous , Jana Wagemaker

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…

Combinatorics · Mathematics 2020-06-09 A. Arnold , P. Cegielski , S. Grigorieff , I. Guessarian

We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras.…

Logic in Computer Science · Computer Science 2007-05-23 Riccardo Pucella

We consider Kleene and Stone algebras defined on the completion DM(RS) of the ordered set of rough sets induced by a reflexive relation. We focus on cases where the completion forms a spatial and completely distributive lattice. We derive…

Rings and Algebras · Mathematics 2026-04-17 Jouni Järvinen , Sándor Radeleczki

We study operator algebras associated to integral domains. In particular, with respect to a set of natural identities we look at the possible nonselfadjoint operator algebras which encode the ring structure of an integral domain. We show…

Operator Algebras · Mathematics 2013-07-23 Benton L. Duncan

We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…

Discrete Mathematics · Computer Science 2015-03-19 Zoltan Esik

Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary…

Logic in Computer Science · Computer Science 2023-06-22 Paul Brunet , Damien Pous

We define and study basic properties of *-continuous Kleene $\omega$-algebras that involve a *-continuous Kleene algebra with a *-continuous action on a semimodule and an infinite product operation that is also *-continuous. We show that…

Formal Languages and Automata Theory · Computer Science 2015-01-07 Zoltán Ésik , Uli Fahrenberg , Axel Legay

We consider algebras of rational power series over an alphabet $\Sigma$ with coefficients in a commutative semiring $K$ and characterize them as the free algebras in various classes of algebraic structures.

Formal Languages and Automata Theory · Computer Science 2011-04-14 Zoltan Esik , Werner Kuich

We exhibit a uniform method for obtaining (wellfounded and non-wellfounded) cut-free sequent-style proof systems that are sound and complete for various classes of action algebras, i.e., Kleene algebras enriched with meets and residuals.…

Logic in Computer Science · Computer Science 2025-01-31 Wesley Fussner , Simon Santschi , Borja Sierra Miranda

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

Logic · Mathematics 2014-10-16 Robin Hirsch , Marcel Jackson , Szabolcs Mikulás

Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…

Rings and Algebras · Mathematics 2023-06-22 Robin Hirsch , Brett McLean

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Andre Arnold , Patrick Cegielski , Serge Grigorieff , Irene Guessarian

We consider skew free extensions of rings, also known as free multivariate skew polynomial rings, and explore some of the algebraic aspects of this construction. We give different characterizations of such rings and present conditions for…

Rings and Algebras · Mathematics 2025-03-03 Vitor O. Ferreira , Érica Z. Fornaroli , Javier Sánchez

We consider rational power series over an alphabet $\Sigma$ with coefficients in a ordered commutative semiring $K$ and characterize them as the free ordered $K$-semialgebras in various classes of ordered $K$-semialgebras equipped with a…

Formal Languages and Automata Theory · Computer Science 2011-02-24 Zoltan Esik , Werner Kuich

Building on \'Esik and Kuich's completeness result for finitely weighted Kleene algebra, we establish relational and language completeness results for finitely weighted Kleene algebra with tests. Similarly as \'Esik and Kuich, we assume…

Logic in Computer Science · Computer Science 2024-07-11 Igor Sedlár

We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…

Group Theory · Mathematics 2022-06-23 Peter M Higgins , Marcel Jackson

In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…

Logic in Computer Science · Computer Science 2026-05-19 Lukas Mulder , Damien Pous , Jana Wagemaker

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. An algebra is said to be affine complete if every congruence preserving function is a polynomial…

Rings and Algebras · Mathematics 2023-06-22 André Arnold , Patrick Cégielski , Irène Guessarian

A semigroup $S$ is called an equational domain if any finite union of algebraic sets over $S$ is algebraic. We prove some necessary and sufficient conditions for a completely simple semigroup to be an equational domain.

Algebraic Geometry · Mathematics 2014-11-06 Artem N. Shevlyakov
‹ Prev 1 2 3 10 Next ›