scientific article
From MaRDI portal
Publication:3217631
zbMath0554.68058MaRDI QIDQ3217631
Andrzej Ehrenfeucht, David Haussler, Janet A. Blumer, Anselm Blumer, Ross M. McConnell
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words), Pseudorandom sequences derived from automatic sequences, 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), On the Structure of Consistent Partitions of Substring Set of a Word, Efficient computation of substring equivalence classes with suffix arrays, Optimal insertion in deterministic DAWGs, Time-Optimal Top-$k$ Document Retrieval, Fast Label Extraction in the CDAWG, Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression, Forty Years of Text Indexing, Special factors and the combinatorics of suffix and factor automata, La reconnaissance des facteurs d'un mot dans un texte, Unnamed Item, Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure, Average sizes of suffix trees and DAWGs, Sliding suffix tree, Unnamed Item, The smallest automaton recognizing the subwords of a text, Discovering characteristic expressions in literary works.
