Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements

09/06/2023
by   Yoshiki Nakamura, et al.
0

We investigate the equational theory of Kleene algebra terms with variable complements – (language) complement where it applies only to variables – w.r.t. languages. While the equational theory w.r.t. languages coincides with the language equivalence (under the standard language valuation) for Kleene algebra terms, this coincidence is broken if we extend the terms with complements. In this paper, we prove the decidability of some fragments of the equational theory: the universality problem is coNP-complete, and the inequational theory t <= s is coNP-complete when t does not contain Kleene-star. To this end, we introduce words-to-letters valuations; they are sufficient valuations for the equational theory and ease us in investigating the equational theory w.r.t. languages. Additionally, we prove that for words with variable complements, the equational theory coincides with the word equivalence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2018

On the expressive power of linear algebra on graphs

Most graph query languages are rooted in logic. By contrast, in this pap...
research
12/05/2019

Complete Variable-Length Codes: An Excursion into Word Edit Operations

Given an alphabet A and a binary relation τ⊆ A * x A * , a language X ⊆ ...
research
12/07/2022

Cocke–Younger–Kasami–Schwartz–Zippel algorithm and relatives

The equivalence problem for unambiguous grammars is an important, but ve...
research
02/14/2022

Processes Parametrised by an Algebraic Theory

We develop a (co)algebraic framework to study a family of process calcul...
research
07/11/2023

On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation

We introduce the k-variable-occurrence fragment, which is the set of ter...
research
09/06/2022

A first-order logic characterization of safety and co-safety languages

Linear Temporal Logic (LTL) is one of the most popular temporal logics, ...
research
06/15/2023

Recursive First-order Syntactic Unification Modulo Variable Classes

We present a generalization of first-order syntactic unification to a te...

Please sign up or login with your details

Forgot password? Click here to reset