A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata (Q3653096): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Penn Treebank / rank | |||
Normal rank | |||
Revision as of 04:20, 29 February 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
18 December 2009
0 references
perfect hashing
0 references
deterministic tree automata
0 references
pseudo-minimal automata
0 references
incremental automata
0 references
