Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleMay 1975
Comparative complexity of grammar forms
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingPages 153–158https://doi.org/10.1145/800116.803764The definition of “grammar form” introduced in [CG] makes it possible to state and prove results about various types of grammars in a uniform way. Among questions naturally formalizable in this framework are many about the complexity or efficiency of ...
- ArticleMay 1975
Degree-languages, polynomial time recognition, and the LBA problem
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingPages 145–152https://doi.org/10.1145/800116.803763The so-called Chomsky hierarchy [5], consisting of regular, context-free, context-sensitive, and recursively enumerable languages, does not account for many “real world” classes of languages, e.g., programming languages and natural languages [4]. This ...
- ArticleMay 1975
On the (combinatorial) structure of L languages without interactions (Extended Abstract)
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingPages 137–144https://doi.org/10.1145/800116.803762This paper presents some such results for various families of L languages without interactions (see, e.g., [2] or [9]). We have chosen to investigate L languages (without interactions) because:
(i) they are physically well motivated, see, e.g., [5],
(ii)...
- ArticleMay 1975
Intercalation theorems for tree transducer languages
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingPages 126–136https://doi.org/10.1145/800116.803761We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rounds [15] and Thatcher [17]. These lemmas are used to prove necessary conditions for languages all of whose strings are of exponential length to be tree ...
- ArticleMay 1975
On decomposing languages defined by parallel devices
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingPages 121–125https://doi.org/10.1145/800116.803760In this paper we give a method for decomposing subclasses of different families of languages, into other possibly smaller families. This method can be used to produce languages not in a family by using known examples of languages not belonging to other ...
- ArticleMay 1975
On (un)predictability of formal languages (Extended Abstract)
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingPages 117–120https://doi.org/10.1145/800116.803759Formal language theory deals with a variety of classes of languages. Some of these are abstracting features of languages used for communication (as e.g., natural languages, programming languages or languages used in logic), some of them are abstracting ...
- ArticleMay 1975
On the complexity of grammar and related problems
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingPages 54–65https://doi.org/10.1145/800116.803753In [1] and [2] a complexity theory for formal languages and automata was developed. This theory implies most of the previously known results and yields many new results as well. Here we develop an analogous theory for several classes of more practically ...
- ArticleMay 1975
Complexity measures and hierarchies for the evaluation of integers, polynomials, and n-linear forms
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingPages 1–5https://doi.org/10.1145/800116.803746The difficulty of evaluating integers and polynomials has been studied in various frameworks ranging from the addition-chain approach [5] to integer evaluation to recent efforts aimed at generating polynomials that are hard to evaluate [2,8,10]. Here we ...
