Optimal insertion in deterministic DAWGs (Q1399983): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average sizes of suffix trees and DAWGs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to squeeze a lexicon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Construction of Minimal Acyclic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3365579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for dynamic processing of dawg's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimisation of acyclic deterministic automata in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864246 / rank
 
Normal rank

Revision as of 17:56, 5 June 2024

scientific article
Language Label Description Also known as
English
Optimal insertion in deterministic DAWGs
scientific article

    Statements

    Optimal insertion in deterministic DAWGs (English)
    0 references
    0 references
    0 references
    0 references
    30 July 2003
    0 references
    DAWG
    0 references
    DFA
    0 references
    minimization
    0 references
    incremental algorithms
    0 references
    spelling checker
    0 references

    Identifiers