TY  - CONF
A1  - Daciuk, Jan
T1  - Perfect hashing tree automata
N2  - 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.
Y1  - 2008
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/2525
UR  - https://nbn-resolving.org/urn:nbn:de:kobv:517-opus-27163
ER  -