A4 Refereed article in a conference publication

On the Solution Sets of Entire Systems of Word Equations




AuthorsSaarela Aleksi

EditorsAnna Frid, Robert Mercaş

Conference nameInternational Conference on Combinatorics on Words

Publishing placeCham

Publication year2023

JournalLecture Notes in Computer Science

Book title Combinatorics on Words: 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings

Series titleLecture Notes in Computer Science

Volume13899

First page 261

Last page273

ISBN978-3-031-33179-4

eISBN978-3-031-33180-0

ISSN0302-9743

eISSN1611-3349

DOIhttps://doi.org/10.1007/978-3-031-33180-0_20

Web address https://link.springer.com/chapter/10.1007/978-3-031-33180-0_20

Self-archived copy’s web addresshttps://research.utu.fi/converis/portal/detail/Publication/179651998


Abstract

The set of all constant-free word equations satisfied by a given morphism is called an entire system of equations. We show that in the three-variable case, the set of nonperiodic solutions of any entire system can be described using parametric formulas with just one numerical parameter. We also show how the solution set of any equation can be represented as a union of solution sets of entire systems. Even though an infinite union is needed in some cases, this still points towards a stronger version of Hmelevskii’s theorem about parametric solutions of three-variable word equations.


Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.





Last updated on 2024-26-11 at 12:08