On the Complexity of the Equational Theory of Relational Action Algebras [chapter]

Wojciech Buszkowski
2006 Lecture Notes in Computer Science  
Pratt [22] defines action algebras as Kleene algebras with residuals. In [9] it is shown that the equational theory of *-continuous action algebras (lattices) is Π 0 1 −complete. Here we show that the equational theory of relational action algebras (lattices) is Π 0 1 −hard, and some its fragments are Π 0 1 −complete. We also show that the equational theory of action algebras (lattices) of regular languages is Π 0 1 −complete.
doi:10.1007/11828563_7 fatcat:gjnpithemffu7gfsaofr3bjdhq