The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Non-Trapping sets and Huygens Principle”

Towards parametrizing word equations

H. Abdulrab, P. Goralčík, G. S. Makanin (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

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...