A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On maximal chains of systems of word equations
Tekijät: Karhumaki J, Saarela A
Kustantaja: MAIK NAUKA/INTERPERIODICA/SPRINGER
Julkaisuvuosi: 2011
Journal: Proceedings of the Steklov Institute of Mathematics
Tietokannassa oleva lehden nimi: PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS
Lehden akronyymi: P STEKLOV I MATH+
Numero sarjassa: 1
Vuosikerta: 274
Numero: 1
Aloitussivu: 116
Lopetussivu: 123
Sivujen määrä: 8
ISSN: 0081-5438
DOI: https://doi.org/10.1134/S0081543811060083
Tiivistelmä
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.
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.
Turun yliopiston Tutkimustietojärjestelmän portaali