Author： Boigelot B. Latour L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.313, Iss.1, 2004-02, pp. : 17-29
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Structural tractability of enumerating CSP solutions
Constraints, Vol. 18, Iss. 1, 2013-01 ,pp. :
Access to resources
Recommend
A shorter proof to uniqueness of solutions of equations
By Mingsheng Y.
Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. :
Maximal and Minimal Solutions to Language Equations
Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. :
On axioms for commutative regular equations without addition
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :