Abstract
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 O(n) (in RAM model). © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
APA
Jez, A. (2013). One-variable word equations in linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7966 LNCS, pp. 324–335). https://doi.org/10.1007/978-3-642-39212-2_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free