47 search results - page 3 / 10 » Partially-Commutative Context-Free Processes |
ICALP
1993
Springer
15 years 5 months ago
1993
Springer
76
Voted
CONCUR
1992
Springer
15 years 5 months ago
1992
Springer
110
Voted
ICGI
2010
Springer
15 years 2 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
124
Voted
ICGI
2000
Springer
15 years 4 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
120
Voted
ICGI
2010
Springer
15 years 2 months ago
2010
Springer
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...