Asymptotic estimation of the average number of terminal states in DAWGs

DOI10.1016/S0166-218X(99)00047-5zbMath0931.68076OpenAlexW2019801045MaRDI QIDQ1304477

Mathieu Raffinot

Publication date: 7 February 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00047-5

zbMATH Keywords

suffix automaton

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mellin transforms and asymptotics: Harmonic sums
• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
• Speeding up two string-matching algorithms
• Average sizes of suffix trees and DAWGs

This page was built for publication: Asymptotic estimation of the average number of terminal states in DAWGs