Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

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

Rafael C. CarrascoJan Daciuk — 2009

RAIRO - Theoretical Informatics and Applications

We describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A pseudo-minimal automaton may be larger than the minimal one accepting the same language but, in turn, it contains proper elements (states or transitions which are unique) for every input accepted by the automaton. Therefore, pseudo-minimal DTA...

Page 1

Download Results (CSV)