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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Penn Treebank / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158388671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimalization of tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Construction and Maintenance of Minimal Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of Deterministic Tree Automata Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental construction of minimal tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to squeeze a lexicon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on “Incremental Construction and Maintenance of Minimal Finite-State Automata,” by Rafael C. Carrasco and Mikel L. Forcada / 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: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-minimal transducer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Ascending and Descending Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318713 / rank
 
Normal rank

Latest revision as of 07:20, 2 July 2024

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
    18 December 2009
    0 references
    perfect hashing
    0 references
    deterministic tree automata
    0 references
    pseudo-minimal automata
    0 references
    incremental automata
    0 references

    Identifiers