Search For:

Displaying 1-2 out of 2 total
Derivation-bounded languages
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Seymour Ginsburg, Edwin H. Spanier
Issue Date:October 1968
pp. 306-314
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...
 
Mapping of languages by two-tape devices
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Seymour Ginsburg, Edwin H. Spanier
Issue Date:November 1964
pp. 57-67
No summary available.
 
 1