Currently displaying 1 – 9 of 9

Showing per page

Order by Relevance | Title | Year of publication

Towards parametrizing word equations

H. AbdulrabP. GoralčíkG. S. Makanin — 2001

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Classically, in order to resolve an equation u v over a free monoid X * , we reduce it by a suitable family of substitutions to a family of equations u f v f , f , each involving less variables than u v , and then combine solutions of u f v f into solutions of u v . The problem is to get in a handy parametrized form. The method we propose consists in parametrizing the path traces in the so called graph of prime equations associated to u v . We carry out such a parametrization in the case the prime equations in the graph...

Towards parametrizing word equations

H. AbdulrabP. GoralčíkG. S. Makanin — 2010

RAIRO - Theoretical Informatics and Applications

Classically, in order to resolve an equation ≈ over a free monoid *, we reduce it by a suitable family of substitutions to a family of equations ≈ , f , each involving less variables than ≈ , and then combine solutions of ≈ into solutions of ≈ . The problem is to get in a handy form. The method we propose consists in parametrizing the path traces in the so called associated to ≈ . We carry out such a parametrization in the case the prime equations in the graph involve at most three...

Page 1

Download Results (CSV)