Geodesic
On maximal chains of systems of word equations
Informatics and Automation, Algorithmic aspects of algebra and logic, Tome 274 (2011), pp. 130-136

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{TRSPY_2011_274_a7,
     author = {Juhani Karhum\"aki and Aleksi Saarela},
     title = {On maximal chains of systems of word equations},
     journal = {Informatics and Automation},
     pages = {130--136},
     publisher = {mathdoc},
     volume = {274},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_2011_274_a7/}
}
TY  - JOUR
AU  - Juhani Karhumäki
AU  - Aleksi Saarela
TI  - On maximal chains of systems of word equations
JO  - Informatics and Automation
PY  - 2011
SP  - 130
EP  - 136
VL  - 274
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_2011_274_a7/
LA  - en
ID  - TRSPY_2011_274_a7
ER  - 
%0 Journal Article
%A Juhani Karhumäki
%A Aleksi Saarela
%T On maximal chains of systems of word equations
%J Informatics and Automation
%D 2011
%P 130-136
%V 274
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_2011_274_a7/
%G en
%F TRSPY_2011_274_a7
Juhani Karhumäki; Aleksi Saarela. On maximal chains of systems of word equations. Informatics and Automation, Algorithmic aspects of algebra and logic, Tome 274 (2011), pp. 130-136. http://geodesic.mathdoc.fr/item/TRSPY_2011_274_a7/