$\mathrm{Pal}^k$ Is Linear Recognizable Online
Formal Languages and Automata Theory
2015-04-01 v4 Data Structures and Algorithms
Abstract
Given a language that is online recognizable in linear time and space, we construct a linear time and space online recognition algorithm for the language , where is the language of all nonempty palindromes. Hence for every fixed positive , is online recognizable in linear time and space. Thus we solve an open problem posed by Galil and Seiferas in 1978.
Cite
@article{arxiv.1404.5244,
title = {$\mathrm{Pal}^k$ Is Linear Recognizable Online},
author = {Dmitry Kosolobov and Mikhail Rubinchik and Arseny M. Shur},
journal= {arXiv preprint arXiv:1404.5244},
year = {2015}
}
Comments
18 pages, 5 figures, presented in SOFSEM 2015