Where academic tradition
meets the exciting future

On Maximal Chains of Systems of Word Equations

Juhani Karhumäki, Aleksi Saarela, On Maximal Chains of Systems of Word Equations. Proceedings of the Steklov Institute of Mathematics 274(1), 116–123, 2011.

http://dx.doi.org/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.

BibTeX entry:

@ARTICLE{jKaSa11a,
  title = {On Maximal Chains of Systems of Word Equations},
  author = {Karhumäki, Juhani and Saarela, Aleksi},
  journal = {Proceedings of the Steklov Institute of Mathematics},
  volume = {274},
  number = {1},
  pages = {116–123},
  year = {2011},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 1

Edit publication