Foundations of Computer Science, Annual IEEE Symposium on
By Seymour Ginsburg, Edwin H. Spanier
Issue Date:October 1968
A derivation in a phrase-structure grammar is said to be k-bounded if each word in the derivation contains at most k occurrences of nonterminals. A set L is said to be derivation bounded if there exists a phrase-structure grammar G and a positive integer k...