Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Word Equations and Related Top...

Word Equations and Related Topics: Independence, Decidability and Chracterizations

Aleksi Saarela, Word Equations and Related Topics: Independence, Decidability and Chracterizations. TUCS Dissertations 145. University of Turku, 2012.

Abstract:

The three main topics of this work are independent systems and chains of word equations, parametric solutions of word equations on three unknowns, and unique decipherability in the monoid of regular languages.

The most important result about independent systems is a new method giving an upper bound for their sizes in the case of three unknowns. The bound depends on the length of the shortest equation. This result has generalizations for decreasing chains and for more than three unknowns. The method also leads to shorter proofs and generalizations of some old results.

Hmelevksii’s theorem states that every word equation on three unknowns has a parametric solution. We give a significantly simplified proof for this theorem. As a new result we estimate the lengths of parametric solutions and get a bound for the length of the minimal nontrivial solution and for the complexity of deciding whether such a solution exists.

The unique decipherability problem asks whether given elements of some monoid form a code, that is, whether they satisfy a nontrivial equation. We give characterizations for when a collection of unary regular languages is a code. We also prove that it is undecidable whether a collection of binary regular languages is a code.

Files:

Full publication in PDF-format

BibTeX entry:

@PHDTHESIS{phdSaarela_Aleksi12a,
  title = {Word Equations and Related Topics: Independence, Decidability and Chracterizations},
  author = {Saarela, Aleksi},
  number = {145},
  series = {TUCS Dissertations},
  school = {University of Turku},
  year = {2012},
  ISBN = {978-952-12-2737-0},
}

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

Edit publication