Deciding the word problem in pure double Boolean algebras |
| |
| Authors: | Philippe Balbiani |
| |
| Affiliation: | Institut de recherche en informatique de Toulouse, CNRS — Université de Toulouse, 118 route de Narbonne, 31062 Toulouse Cedex 9, France |
| |
| Abstract: | Pure double Boolean algebras have attracted interest both for their theoretical merits and for their practical relevance. The aim of this article is to investigate the decidability and the complexity of the word problem in pure double Boolean algebras. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
