234 search results - page 10 / 47 » On Quasi-Products of Tree Automata |
160
click to vote
DKE
2006
15 years 1 months ago
2006
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...
CAI
2007
Springer
15 years 7 months ago
2007
Springer
ACL
2011
14 years 5 months ago
2011
127
click to vote
CSL
2007
Springer
15 years 5 months ago
2007
Springer
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...