A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata (Q3653096): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:31, 5 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
