The hardness of solving simple word equations

We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both left and right hand sides is preserved (the variables can be, however, separated by potentially distinct constant factors). S...

Full description

Saved in:
Bibliographic Details
Main Authors: Joel Day, Florin Manea, Dirk Nowotka
Format: Default Conference proceeding
Published: 2017
Subjects:
Other information and computing sciences not elsewhere classified
Word equations
Regular patterns
Regular constraints
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/37618
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/37618

Similar Items