20 search results - page 1 / 4 » Characterization of Context-Free Languages with Polynomially... |
110
Voted
MFCS
2001
Springer
15 years 5 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...
121
click to vote
ICGI
2010
Springer
14 years 10 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
102
Voted
WIA
2007
Springer
15 years 7 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
102
click to vote
MFCS
1998
Springer
15 years 5 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
114
click to vote
ENTCS
2010
15 years 1 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...