268 search results - page 2 / 54 » Linear Context Free Languages |
CPAIOR
2009
Springer
13 years 12 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
ICGI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
EACL
2009
ACL Anthology
14 years 5 months ago
2009
ACL Anthology
ICGI
2010
Springer
13 years 6 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...
CP
2009
Springer
14 years 6 months ago
2009
Springer
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen...