Skip to main content
Conference ProceedingsOPEN ACCESS

Systems of equations satisfied in all commutative finite semigroups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4962 LNCS 261-272
DOI: 10.1007/978-3-540-78499-9_19
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The following problem is considered: check if a system of equations has a solution in every commutative finite semigroup. It is shown that the problem is decidable, and NP-complete. The problem is related with the pumping lemma for regular languages. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Parys, P. (2008). Systems of equations satisfied in all commutative finite semigroups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4962 LNCS, pp. 261–272). https://doi.org/10.1007/978-3-540-78499-9_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free