Sciweavers

2944 search results - page 1 / 589
» On Well Quasi-orders on Languages
Sort
View
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 5 months ago
From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets
Maurice Pouzet, Norbert Sauer
SIAMDM
2008
115views more  SIAMDM 2008»
13 years 5 months ago
Rank-Width and Well-Quasi-Ordering
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
Sang-il Oum
JCT
2002
90views more  JCT 2002»
13 years 5 months ago
Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
James F. Geelen, A. M. H. Gerards, Geoff Whittle
DLT
2009
13 years 3 months ago
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
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...
Makoto Kanazawa
EMNLP
2009
13 years 3 months ago
How well does active learning
Machine involvement has the potential to speed up language documentation. We assess this potential with timed annotation experiments that consider annotator expertise, example sel...
Jason Baldridge, Alexis Palmer