Language Kleene Algebra with Complement: A Finite Relational Semantics and (Un)decidability - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2024

Language Kleene Algebra with Complement: A Finite Relational Semantics and (Un)decidability

Résumé

We study the equational theory of Kleene algebra with complement w.r.t. languages. While the equational theory w.r.t. languages coincides with the language equivalence (under the standard language valuation) for terms of Kleene algebra, this coincidence is broken if we extend the terms with complement. In this paper, we present a finite relational semantics, which completely characterizes the equational theory above. As applications, we show that the equational theory is (1) undecidable and Π 0 1-complete for full terms; (2) decidable and PSPACE-complete if the complement only applies to variables or constants.
Fichier principal
Vignette du fichier
LKA_with_complement.pdf (816.89 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04455882 , version 1 (13-02-2024)
hal-04455882 , version 2 (13-07-2024)

Identifiants

  • HAL Id : hal-04455882 , version 1

Citer

Yoshiki Nakamura. Language Kleene Algebra with Complement: A Finite Relational Semantics and (Un)decidability. 2024. ⟨hal-04455882v1⟩
208 Consultations
67 Téléchargements

Partager

More