General suffix automaton construction algorithm and space bounds

DOI10.1016/j.tcs.2009.03.034zbMath1194.68143OpenAlexW2119425792WikidataQ90410808 ScholiaQ90410808MaRDI QIDQ840781

Mehryar Mohri, Eugene Weinstein, Pedro Moreno

Publication date: 14 September 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.034

zbMATH Keywords

finite automataindexingsuffix treesstring-matchingsuffix automatafactor automatainverted textmusic identificationpattern-matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)

Related Items (1)

Encoding musical procedures by sequential transducers

Cites Work

• Unnamed Item
• The smallest automaton recognizing the subwords of a text
• Minimisation of acyclic deterministic automata in linear time
• On-line construction of compact directed acyclic word graphs
• Transducers and repetitions
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Complete inverted files for efficient text retrieval and analysis

This page was built for publication: General suffix automaton construction algorithm and space bounds