On maximal chains of systems of word equations




Karhumaki J, Saarela A

PublisherMAIK NAUKA/INTERPERIODICA/SPRINGER

2011

Proceedings of the Steklov Institute of Mathematics

PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS

P STEKLOV I MATH+

1

274

1

116

123

8

0081-5438

DOIhttps://doi.org/10.1134/S0081543811060083



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.



Last updated on 2024-26-11 at 14:58