On the system of word equations \(x_{0} u^{i}_{1} x_{1} u^{i}_{2} x_{2} u^{i}_{3} x_{3}=y_{0} v^{i}_{1} y_{1} v^{i}_{2} y_{2} v^{i}_{3} y_{3}\) \((i=0,1,2,\ldots)\) in a free monoid

DOI10.1016/S0304-3975(97)00255-7zbMath0930.68076OpenAlexW15119952WikidataQ112040594 ScholiaQ112040594MaRDI QIDQ1960659

Juha Kortelainen, Ismo Hakala

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00255-7

zbMATH Keywords

word equations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On systems of word equations with simple loop sets ⋮ Linear size test sets for certain commutative languages

Cites Work

• Unnamed Item
• Unnamed Item
• A proof of Ehrenfeucht's conjecture
• On the system of word equations \(x^ i_ 1 x^ i_ 2\dots x^ i_ m=y^ i_ 1 y^ i_ 2\dots y^ i_ n\) \((i=1,2,\dots)\) in a free monoid
• Test sets for context free languages and algebraic systems of equations over a free monoid
• Uniqueness Theorems for Periodic Functions
• On the Equation Z n 1 Z n 2 ⋯z n k = y n in a Free Semigroup

This page was built for publication: On the system of word equations \(x_{0} u^{i}_{1} x_{1} u^{i}_{2} x_{2} u^{i}_{3} x_{3}=y_{0} v^{i}_{1} y_{1} v^{i}_{2} y_{2} v^{i}_{3} y_{3}\) \((i=0,1,2,\ldots)\) in a free monoid