1423 search results - page 8 / 285 » Languages of Nested Trees |
VLDB
1989
ACM
15 years 6 months ago
1989
ACM
200
Voted
ECOOP
2009
Springer
16 years 3 months ago
2009
Springer
106
Voted
DLT
2009
15 years 10 days ago
2009
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
126
click to vote
WISE
2005
Springer
15 years 8 months ago
2005
Springer
This paper studies automatic extraction of structured data from Web pages. Each of such pages may contain several groups of structured data records. Existing automatic methods stil...