COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES

DOI10.1142/S0129054105003741zbMath1105.68024MaRDI QIDQ5714666

Christophe Moan, Alban Mancheron

Publication date: 15 December 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

automatacharacterizationlanguagefactor oraclesuffix oracle

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Related Items (5)

THE STRUCTURE OF FACTOR ORACLES ⋮ Converting suffix trees into factor/suffix oracles ⋮ Statistical properties of factor oracles ⋮ A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms ⋮ Statistical Properties of Factor Oracles

Cites Work

• The smallest automaton recognizing the subwords of a text
• Compror: On-line lossless data compression with a factor oracle.
• On-line construction of suffix trees
• Algorithms on Strings, Trees and Sequences
• A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences

This page was built for publication: COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES