Skip to main content
Journal Article

Solving two-variable word equations (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3142 408-419
DOI: 10.1007/978-3-540-27836-8_36
11Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an algorithm that solves word equations in two variables. It computes a polynomial size description of the equation's solutions in time O(n5). This additionally improves the result by Ilie and Plandowski [8] by giving the currently fastest algorithm to decide solvability of two-variable word equations. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Da̧browski, R., & Plandowski, W. (2004). Solving two-variable word equations (extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3142, 408–419. https://doi.org/10.1007/978-3-540-27836-8_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free