A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata (Q3653096)

From MaRDI portal
Revision as of 08:20, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
scientific article

    Statements

    A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata (English)
    0 references
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    perfect hashing
    0 references
    deterministic tree automata
    0 references
    pseudo-minimal automata
    0 references
    incremental automata
    0 references
    0 references