Pal k is Linear Recognizable Online

DOI10.1007/978-3-662-46078-8_24zbMath1432.68228arXiv1404.5244OpenAlexW380317070MaRDI QIDQ5175115

Arseny M. Shur, Dmitry Kosolobov, Mikhail Rubinchik

Publication date: 20 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5244

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics on words (68R15) Formal languages and automata (68Q45) Online algorithms; streaming algorithms (68W27)

Related Items (11)

Palindromic decompositions with gaps and errors ⋮ EERTREE: an efficient data structure for processing palindromes in strings ⋮ Maximal degenerate palindromes with gaps and mismatches ⋮ Palindromic Decompositions with Gaps and Errors ⋮ Computing longest palindromic substring after single-character or block-wise edits ⋮ Detecting One-Variable Patterns ⋮ Counting Palindromes in Substrings ⋮ Diverse Palindromic Factorization is NP-Complete ⋮ Unnamed Item ⋮ Palindromic rich words and run-length encodings ⋮ Upper bound for palindromic and factor complexity of rich words

This page was built for publication: Pal k is Linear Recognizable Online