382 search results - page 10 / 77 » Generalized Multitext Grammars |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
IPL
2011
12 years 10 months ago
2011
Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We genera...
ACTA
2007
13 years 7 months ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
FLAIRS
2008
13 years 9 months ago
2008
The Applicative and Combinatory Categorial Grammar (ACCG) (Biskri, Descl
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...