3440 search results - page 5 / 688 » Logics For Context-Free Languages |
FUIN
2008
14 years 9 months ago
2008
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...
105
click to vote
MLMTA
2007
14 years 11 months ago
2007
- While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, speech and pattern recognition, its application to...
112
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 ...
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
100
click to vote
ICGI
2000
Springer
15 years 1 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...