An Analysis and a Reproof of Hmelevskii’s Theorem

DOI10.1007/978-3-540-85780-8_37zbMath1161.68706OpenAlexW1834039366MaRDI QIDQ3533033

Juhani Karhumäki, Aleksi Saarela

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_37

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Systems of word equations, polynomials and linear algebra: a new approach ⋮ On the Solution Sets of Entire Systems of Word Equations ⋮ An Analysis and a Reproof of Hmelevskii’s Theorem ⋮ On maximal chains of systems of word equations ⋮ On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations ⋮ A logic for document spanners

Cites Work

• A proof of Ehrenfeucht's conjecture
• Equations in free semigroups
• ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
• An Analysis and a Reproof of Hmelevskii’s Theorem
• Satisfiability of word equations with constants is in PSPACE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item