The smallest automaton recognizing the subwords of a text
From MaRDI portal
Publication:1063423
DOI10.1016/0304-3975(85)90157-4zbMath0574.68070WikidataQ29036151 ScholiaQ29036151MaRDI QIDQ1063423
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90157-4
68Q45: Formal languages and automata
Related Items
A variation on the Boyer-Moore algorithm, Approximate string-matching with \(q\)-grams and maximal matches, Data compression with factor automata
Uses Software