An algorithm for dynamic processing of dawg's

DOI10.1080/00207169408804348zbMath0839.68027OpenAlexW2026551868MaRDI QIDQ4844553

Katsushi Morimoto, Jun-ichi Aoe, Masami Shishibori, Kihong Park

Publication date: 28 May 1996

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

Full work available at URL: https://doi.org/10.1080/00207169408804348

zbMATH Keywords

search treetrie

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (4)

Optimal insertion in deterministic DAWGs ⋮ A fast retrieval technique for large graph structures ⋮ A fast and compact technique of implementing transition tables for finite state automata ⋮ How to squeeze a lexicon

Cites Work

• Collections of Functions for Perfect Hashing
• Compressed tries
• Median split trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for dynamic processing of dawg's