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:elar.urfu.ru:10995/102405

Palk is linear recognizable online

Authors
Publication date
1 January 2015
Publisher
Springer Verlag
Doi

    Abstract

    Given a language L that is online recognizable in linear time and space, we construct a linear time and space online recognition algorithm for the language L・Pal, where Pal is the language of all nonempty palindromes. Hence for every fixed positive k, Palk is online recognizable in linear time and space. Thus we solve an open problem posed by Galil and Seiferas in 1978. © Springer-Verlag Berlin Heidelberg 2015

    Similar works

    Full text

    thumbnail-image

    Institutional repository of Ural Federal University named after the first President of Russia B.N.Yeltsin

    redirect
    oaioai:elar.urfu.ru:10995/102405
    Last time updated on 06/11/2021

    This paper was published in Institutional repository of Ural Federal University named after the first President of Russia B.N.Yeltsin.

    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.