268 search results - page 6 / 54 » Linear Context Free Languages |
JALC
2007
13 years 7 months ago
2007
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
CAAP
1994
13 years 11 months ago
1994
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
IPL
1998
13 years 7 months ago
1998
We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.
FUIN
2008
13 years 7 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...
MLMTA
2007
13 years 8 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...