86 research outputs found
Kleene Algebra with Converse
International audienceThe equational theory generated by all algebras of binary relations with operations of union, composition, converse and reflexive transitive closure was studied by Bernátsky, Bloom, Ésik, and Stefanescu in 1995. We reformulate some of their proofs in syntactic and elementary terms, and we provide a new algorithm to decide the corresponding theory. This algorithm is both simpler and more efficient; it relies on an alternative automata construction, that allows us to prove that the considered equational theory lies in the complexity class PSPACE. Specific regular languages appear at various places in the proofs. Those proofs were made tractable by considering appropriate automata recognising those languages, and exploiting symmetries in those automata
Completeness and Incompleteness of Synchronous Kleene Algebra
Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was
proposed by Prisacariu as a tool for reasoning about programs that may execute
synchronously, i.e., in lock-step. We provide a countermodel witnessing that
the axioms of SKA are incomplete w.r.t. its language semantics, by exploiting a
lack of interaction between the synchronous product operator and the Kleene
star. We then propose an alternative set of axioms for SKA, based on Salomaa's
axiomatisation of regular languages, and show that these provide a sound and
complete characterisation w.r.t. the original language semantics.Comment: Accepted at MPC 201
Recommended from our members
Containment and equivalence of weighted automata: Probabilistic and max-plus cases
This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps from words to real values. Given two weighted automata, the equivalence problem asks whether their semantics are the same, and the containment problem whether one is point-wise smaller than the other one. These problems have been studied intensively and this paper will review some techniques used to show (un)decidability and state a list of open questions that still remain
Spectral extension of the quantum group cotangent bundle
The structure of a cotangent bundle is investigated for quantum linear groups
GLq(n) and SLq(n). Using a q-version of the Cayley-Hamilton theorem we
construct an extension of the algebra of differential operators on SLq(n)
(otherwise called the Heisenberg double) by spectral values of the matrix of
right invariant vector fields. We consider two applications for the spectral
extension. First, we describe the extended Heisenberg double in terms of a new
set of generators -- the Weyl partners of the spectral variables. Calculating
defining relations in terms of these generators allows us to derive SLq(n) type
dynamical R-matrices in a surprisingly simple way. Second, we calculate an
evolution operator for the model of q-deformed isotropic top introduced by
A.Alekseev and L.Faddeev. The evolution operator is not uniquely defined and we
present two possible expressions for it. The first one is a Riemann theta
function in the spectral variables. The second one is an almost free motion
evolution operator in terms of logarithms of the spectral variables. Relation
between the two operators is given by a modular functional equation for Riemann
theta function.Comment: 38 pages, no figure
Combinatorial Hopf algebras and Towers of Algebras
Bergeron and Li have introduced a set of axioms which guarantee that the
Grothendieck groups of a tower of algebras can be
endowed with the structure of graded dual Hopf algebras. Hivert and Nzeutzhap,
and independently Lam and Shimozono constructed dual graded graphs from
primitive elements in Hopf algebras. In this paper we apply the composition of
these constructions to towers of algebras. We show that if a tower
gives rise to graded dual Hopf algebras then we must
have where .Comment: 7 page
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
We review the rudiments of the equational logic of (least) fixed points and provide some of its applications for axiomatization problems with respect to regular languages, tree languages, and synchronization trees
Untyping Typed Algebras and Colouring Cyclic Linear Logic
We prove "untyping" theorems: in some typed theories (semirings, Kleene
algebras, residuated lattices, involutive residuated lattices), typed equations
can be derived from the underlying untyped equations. As a consequence, the
corresponding untyped decision procedures can be extended for free to the typed
settings. Some of these theorems are obtained via a detour through fragments of
cyclic linear logic, and give rise to a substantial optimisation of standard
proof search algorithms.Comment: 21
- …