Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:pure.mpg.de:item_1922480

One-variable Word Equations in Linear Time

Authors
Publication date
1 January 2013
Publisher
'Springer Science and Business Media LLC'
Doi

    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)

    Similar works

    Full text

    thumbnail-image

    MPG.PuRe

    redirect
    oaioai:pure.mpg.de:item_1922480
    Last time updated on 15/06/2019

    This paper was published in MPG.PuRe.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.