Palk is linear recognizable online

Authors
Publication date
1 January 2015
Publisher
'Springer Science and Business Media LLC'
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

      Available Versions

      CiteSeerX

      redirect
      oaioai:CiteSeerX.psu:10.1.1.751.4...
      Last time updated on 30/10/2017

      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