An algorithm for dynamic processing of dawg's

DOI10.1080/00207169408804348MaRDI QIDQ4844553zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Optimal insertion in deterministic DAWGs
• Implementation of directed acyclic word graph.
• Ternary directed acyclic word graphs
• Ternary directed acyclic word graphs
• scientific article; zbMATH DE number 1962785

Cites work

• Collections of Functions for Perfect Hashing
• Compressed tries
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• Median split trees

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4844553)