Sciweavers

54 search results - page 1 / 11
» Efficient Context-Free Grammar Constraints
Sort
View
AAAI
2008
13 years 8 months ago
Efficient Context-Free Grammar Constraints
Serdar Kadioglu, Meinolf Sellmann
CP
2009
Springer
14 years 7 months ago
Restricted Global Grammar Constraints
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...
George Katsirelos, Sebastian Maneth, Nina Narodyts...
JMLR
2010
134views more  JMLR 2010»
13 years 1 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
CPAIOR
2009
Springer
14 years 26 days ago
The Polytope of Context-Free Grammar Constraints
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 ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
DLT
2004
13 years 7 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda