Return to search

Perfect hashing tree automata

We present an algorithm that computes a function that assigns consecutive integers to trees recognized by a deterministic, acyclic, finite-state, bottom-up tree automaton. Such function is called minimal perfect hashing. It can be used to identify trees recognized by the automaton. Its value may be seen as an index in some other data structures. We also present an algorithm for inverted hashing.

Identiferoai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:2716
Date January 2008
CreatorsDaciuk, Jan
PublisherUniversität Potsdam, Extern. Extern
Source SetsPotsdam University
LanguageEnglish
Detected LanguageEnglish
TypeInProceedings
Formatapplication/pdf
Rightshttp://opus.kobv.de/ubp/doku/urheberrecht.php

Page generated in 0.0021 seconds