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.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS
  • Export XML

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Jan Daciuk
URN:urn:nbn:de:kobv:517-opus-27163
Document Type:Conference Proceeding
Language:English
Date of Publication (online):2008/12/11
Year of Completion:2008
Publishing Institution:Universit├Ąt Potsdam
Release Date:2008/12/11
Organizational units:Extern / Extern
Dewey Decimal Classification:4 Sprache / 40 Sprache / 400 Sprache
Collections:Universit├Ąt Potsdam / Tagungen / Finite-state methods and natural language processing : 6th International Workshop, FSMNLP 2007 / II Regular Papers
Licence (German):License LogoKeine Nutzungslizenz vergeben - es gilt das deutsche Urheberrecht
Notes extern:
The complete edition of the proceedings "Finite-state methods and natural language processing : 6th International Workshop, FSMNLP 2007 ; Revised Papers" is available:
URN urn:nbn:de:kobv:517-opus-23812