INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE-Reference-Cited by-同舟云学术

INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE

Published:2007-12 Issue:06 Volume:18 Page:1167-1175
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

CZEIZLER ELENA¹,HOLUB ŠTĚPÁN²,KARHUMÄKI JUHANI³,LAINE MARKKU³

Affiliation:

1. Department of Mathematics and Turku Centre for Computer Science, University of Turku, Joukahaisenkatu 3–5 B, 6th floor, Turku, 20520, Finland

2. Department of Algebra, Charles University in Prague, Sokolovska 83, Praha 8, 186 75, Czech Republic

3. Department of Mathematics and Turku Centre for Computer Science, University of Turku, Turku, 20014, Finland

Abstract

As is well known, simple word equations can be very tedious to solve, often requiring specific ad hoc methods. We illustrate this by giving an example of an equation over four unknowns, having only periodic solutions, but for which showing this is not at all obvious.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054107005212

Reference10 articles.

1. Combinatorics of Words

2. On the equality sets for homomorphisms on free monoids with two generators

3. V. Diekert, Algebraic Combinatorics on Words, ed. M. Lothaire (Cambridge University Press, 2002) pp. 387–442.

4. The Equation xi = yjzk in a Free Semigroup

5. Binary equality sets are generated by two words

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Word Equations in the Context of String Solving;Developments in Language Theory;2022

2. Formalizing a Fragment of Combinatorics on Words;Unveiling Dynamics and Complexity;2017

3. Commutation and Beyond;Lecture Notes in Computer Science;2017

4. Periodicity forcing words;Theoretical Computer Science;2015-10

5. Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words;Language and Automata Theory and Applications;2015