On the system of word equations x 0 u i 1 x 1 u i 2 x 2 u i 3 x 3 = y 0 v i 1 y 1 v i 2 y 2 v i 3 y 3 (i = 0, 1 2, ...) in a free monoid

Author： Hakala I.   Kortelainen J.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.225, Iss.1, 1999-08, pp. : 149-161

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

“Miniaturized” Linearizations for Quadratic 0/1 Problems

By Gueye Serigne  

Annals of Operations Research, Vol. 140, Iss. 1, 2005-11 ,pp. : 235-261

Springer Publishing Company

Access to resources Recommend Favorite

On the set covering polytope:Facets with coefficients in {0, 1, 2, 3}

By M   M   B  

Annals of Operations Research, Vol. 81, Iss. 1, 1998-01 ,pp. : 343-356

Springer Publishing Company

Access to resources Recommend Favorite

Proving Invariants of I/O Automata with TAME

By Archer M.  

Automated Software Engineering, Vol. 9, Iss. 3, 2002-08 ,pp. : 201-232

Springer Publishing Company

Access to resources Recommend Favorite

Constrained discriminant analysis via 0/1 mixed integer programming

By Gallagher R.J.   Lee E.K.   Patterson D.A.  

Annals of Operations Research, Vol. 74, Iss. 1, 1997-01 ,pp. : 65-88

Springer Publishing Company

Access to resources Recommend Favorite

Jackson’s Pseudo Preemptive Schedule for the Pm/r_{i}, q_{i}/C_{max} scheduling problem

By Carlier J.   Pinson E.  

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 41-58

Springer Publishing Company

Access to resources Recommend Favorite