On the Complexity of the Equational Theory of Relational Action Algebras
From MaRDI portal
Publication:5459176
DOI10.1007/11828563_7zbMath1135.68018OpenAlexW1590164729MaRDI QIDQ5459176
Publication date: 24 April 2008
Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11828563_7
Formal languages and automata (68Q45) Logic in computer science (03B70) Applications of universal algebra in computer science (08A70) Other algebras related to logic (03G25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Equational classes, universal algebra in model theory (03C05)
Related Items (max. 100)
Language models for some extensions of the Lambek calculus ⋮ Relational Models for the Lambek Calculus with Intersection and Constants ⋮ Relational models for the Lambek calculus with intersection and unit ⋮ Infinitary action logic: complexity, models and grammars ⋮ Equational theories for automata ⋮ COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR
This page was built for publication: On the Complexity of the Equational Theory of Relational Action Algebras
