Query automata over finite trees

Abstract

A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map a tree to a set of its nodes, play an important role in the context of structured document databases. The motivation of this work is to understand how the natural and well-studied computation model… (More)
DOI: 10.1016/S0304-3975(01)00301-2

Topics

  • Presentations referencing similar topics