Add to ORKGIt is known that the satisfiability problem for equations over free partially commutative monoids is decidable but computationally hard. In this paper we consider the satisfiability problem for equations over free partially commutative monoids under the constraint that the solution is a subset of the alphabet. We prove that this problem is NP-complete for quadratic equations and that its uniform version is NP-complete for linear equations
Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solut...
Given a linear equationL, a setAof integers isL-free ifAdoes not contain anynon-trivial solutions to...
Let I be a partially commutative alphabet of size three. Let M denote the free partially commutative...
It is known that the satisfiability problem for equations over free partially commutative monoids is...
AbstractIt is shown that it is decidable whether an equation over a free partially commutative monoi...
© Volker Diekert, Artur Jez, and Manfred Kufleitner. We give NSPACE(n log n) algorithms solving the ...
We give NSPACE(n*log(n)) algorithms solving the following decision problems. Satisfiability: Is the ...
In this paper we summarize some results of a work in progress on the computational complexity of the...
. Very recently, the second author showed that the question whether an equation over a trace monoid ...
We investigate the class of regular-ordered word equations. In such equations, each variable occurs ...
AbstractIn this paper we evaluate the complexity of an algorithm for deciding whether a partially co...
AbstractWe characterize here the free partially commutative monoids the regular sets of which form a...
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
Trace monoids are well-studied objects in computer science where they serve as a basic algebraic to...
We introduce the notion of idempotent variables for studying equations in inverse monoids. It is pro...
Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solut...
Given a linear equationL, a setAof integers isL-free ifAdoes not contain anynon-trivial solutions to...
Let I be a partially commutative alphabet of size three. Let M denote the free partially commutative...
It is known that the satisfiability problem for equations over free partially commutative monoids is...
AbstractIt is shown that it is decidable whether an equation over a free partially commutative monoi...
© Volker Diekert, Artur Jez, and Manfred Kufleitner. We give NSPACE(n log n) algorithms solving the ...
We give NSPACE(n*log(n)) algorithms solving the following decision problems. Satisfiability: Is the ...
In this paper we summarize some results of a work in progress on the computational complexity of the...
. Very recently, the second author showed that the question whether an equation over a trace monoid ...
We investigate the class of regular-ordered word equations. In such equations, each variable occurs ...
AbstractIn this paper we evaluate the complexity of an algorithm for deciding whether a partially co...
AbstractWe characterize here the free partially commutative monoids the regular sets of which form a...
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
Trace monoids are well-studied objects in computer science where they serve as a basic algebraic to...
We introduce the notion of idempotent variables for studying equations in inverse monoids. It is pro...
Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solut...
Given a linear equationL, a setAof integers isL-free ifAdoes not contain anynon-trivial solutions to...
Let I be a partially commutative alphabet of size three. Let M denote the free partially commutative...