Developments in Language Theory
From MaRDI portal
Publication:5711956
DOI10.1007/B103739zbMath1117.68388OpenAlexW2496880349WikidataQ57001653 ScholiaQ57001653MaRDI QIDQ5711956
Masayuki Takeda, Shunsuke Inenaga, Ayumi Shinohara
Publication date: 22 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b103739
Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)
Related Items (2)
Computing Longest Common Substring and All Palindromes from Compressed Strings ⋮ Efficient algorithms to compute compressed longest common substrings and compressed palindromes
This page was built for publication: Developments in Language Theory
