21 search results - page 2 / 5 » Strongly Regular Grammars and Regular Approximation of Conte... |
STACS
2004
Springer
15 years 2 months ago
2004
Springer
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
ANLP
2000
14 years 10 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
107
click to vote
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
155
click to vote
CP
2009
Springer
15 years 10 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...
JMLR
2010
14 years 4 months ago
2010
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...