Counting distinct strings
From MaRDI portal
Publication:1277320
DOI10.1007/PL00009247zbMath0913.68088OpenAlexW1968529705MaRDI QIDQ1277320
Publication date: 2 February 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009247
Related Items
New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings ⋮ Inferring strings from Lyndon factorization ⋮ On Maximal Unbordered Factors ⋮ Validating the Knuth-Morris-Pratt failure function, fast and online ⋮ Combinatorics on partial word borders ⋮ Representing prefix and border tables: results on enumeration ⋮ Verifying and enumerating parameterized border arrays ⋮ Counting suffix arrays and strings ⋮ Inferring strings from suffix trees and links on a binary alphabet ⋮ Border correlation of binary words ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ Efficient validation and construction of border arrays and validation of string matching automata ⋮ Inferring an indeterminate string from a prefix graph
