Publication:3690247
From MaRDI portal
zbMath0572.68069MaRDI QIDQ3690247
No author found.
Publication date: 1985
68Q45: Formal languages and automata
Related Items
On-line construction of two-dimensional suffix trees, Generalizations of suffix arrays to multi-dimensional matrices., Multiple matching of parameterized patterns, On average sequence complexity, On suffix extensions in suffix trees, Construction of Aho Corasick automaton in linear time for integer alphabets, Parallel construction of minimal suffix and factor automata, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, The smallest automaton recognizing the subwords of a text, Fast string matching with k differences, La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time), The suffix tree of a tree and minimizing sequential transducers, On finding common subtrees, Two-dimensional dictionary matching, Dynamic dictionary matching with failure functions, Generalizations of suffix arrays to multi-dimensional matrices., On-line construction of compact directed acyclic word graphs, Approximation algorithms for the shortest common superstring problem, Generalized function matching
