Recursive star-tree parallel data structure
SIAM Journal on Computing
Satisfiability of word equations with constants is in NEXPTIME
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient Solving of the Word Equations in One Variable
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Application of Lempel-Ziv Encodings to the Solution of Words Equations
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Satisfiability of word equations with constants is in PSPACE
Journal of the ACM (JACM)
Linear work suffix array construction
Journal of the ACM (JACM)
On Word Equations in One Variable
Algorithmica
Compressed membership in automata with compressed labels
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Faster fully compressed pattern matching by recompression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
In this paper we consider word equations with one variable (and arbitrary many appearances of it). A recent technique of recompression, which is applicable to general word equations, is shown to be suitable also in this case. While in general case it is non-deterministic, it determinises in case of one variable and the obtained running time is $\mathcal{O}(n)$ (in RAM model).