On maximal chains of systems of word equations
arXiv:1506.02913 · doi:10.1134/S0081543811060083
Abstract
We consider systems of word equations and their solution sets. We discuss some fascinating properties of those, namely the size of a maximal independent set of word equations, and proper chains of solution sets of those. We recall the basic results, extend some known results and formulate several fundamental problems of the topic.
10 pages. This is a journal article published in 2011, together with a note about a missing reference added in 2015