Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras

Authors:
Clifford Bergman;Giora Slutzki
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
2000

Citing 0
Cited 5

Computational complexity of some problems involving congruences on algebras

Theoretical Computer Science
Computational Complexity of Some Problems Involving Congruences on Algebras

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Structure identification of Boolean relations and plain bases for co-clones

Journal of Computer and System Sciences
A note on the expressibility problem for modal logics and star-free regular expressions

Information Processing Letters
Collapsing words: a progress report

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B satisfy precisely the same identities? (2) Do they satisfy the same quasi-identities? (3) Do A and B have the same set of term operations?In addition to the general case in which we allow arbitrary (finite) algebras, we consider each of these problems under the restrictions that all operations are unary and that A and B have cardinality two. We briefly discuss the relationship of these problems to algebraic specification theory.