Optimal insertion in deterministic DAWGs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3974159
- scientific article; zbMATH DE number 4039135
- Optimal Interactive Coding for Insertions, Deletions, and Substitutions
- Optimal deterministic algorithm generation
- Stochastic Algorithms: Foundations and Applications
- Tight bounds for graph problems in insertion streams
- Optimum Algorithms for a Model of Direct Chaining
- OPTIMAL DELAUNAY POINT INSERTION
- scientific article; zbMATH DE number 1962793
Cites work
- scientific article; zbMATH DE number 3883638 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 839553 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- An algorithm for dynamic processing of dawg's
- Average sizes of suffix trees and DAWGs
- Direct construction of minimal acyclic finite states automata
- How to squeeze a lexicon
- Incremental Construction of Minimal Acyclic Finite-State Automata
- Minimisation of acyclic deterministic automata in linear time
- On the computational power of pushdown automata
Cited in
(5)
This page was built for publication: Optimal insertion in deterministic DAWGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399983)