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

Yoshiki Nakamura
(Tokyo Institute of Technology)
Ryoma Sin'ya
(Akita University)

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.

In Zsolt Gazdag, Szabolcs Iván and Gergely Kovásznai: Proceedings of the 16th International Conference on Automata and Formal Languages (AFL 2023), Eger, Hungary, September 5-7, 2023, Electronic Proceedings in Theoretical Computer Science 386, pp. 185–199.
Published: 3rd September 2023.

ArXived at: https://dx.doi.org/10.4204/EPTCS.386.15 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org