IPL
1998
13 years 4 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 5 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...
DLT
2001
13 years 6 months ago
2001
Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...