Sciweavers

254 search results - page 13 / 51
» Restarting Tree Automata
Sort
View
DKE
2006
139views more  DKE 2006»
13 years 8 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
DBPL
2005
Springer
93views Database» more  DBPL 2005»
14 years 2 months ago
Minimizing Tree Automata for Unranked Trees
Wim Martens, Joachim Niehren
CSL
2007
Springer
14 years 22 days ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 9 months ago
XPath Whole Query Optimization
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
Sebastian Maneth, Kim Nguyen