scientific article; zbMATH DE number 2011852

zbMath1032.68124MaRDI QIDQ4437504

Filippo Mignosi, Marinella Sciortino, A. Gabriele, Antonio Restivo

Publication date: 2 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530140.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

automata theoryindexingapproximate string matchingsuffix treesCombinatorics on wordsDAWGs

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (7)

From Nerode's congruence to suffix automata with mismatches ⋮ Fast index for approximate string matching ⋮ On the Suffix Automaton with Mismatches ⋮ Dictionary-symbolwise flexible parsing ⋮ Text indexing with errors ⋮ Languages with mismatches ⋮ A new method for approximate indexing and dictionary lookup with one error

This page was built for publication: