scientific article
From MaRDI portal
Publication:3746902
zbMath0607.68054MaRDI QIDQ3746902
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Discrete mathematics in relation to computer science (68R99)
Related Items
On Boyer-Moore automata, Data structures and algorithms for approximate string matching, Parallel construction of a suffix tree with applications, Fast string matching with k differences, String-matching with OBDDs, Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays, Efficient detection of quasiperiodicities in strings, Parsing with a finite dictionary, Unnamed Item, On the size of Boyer-Moore automata, Three one-way heads cannot do string matching, Discovering characteristic expressions in literary works.
