A Pumping Lemma Scheme for the Control Language Hierarchy
نویسندگان
چکیده
In [9] Weir introduced control grammars as a model for describing the syntactic structure of natural languages. Informally, a control grammar is a pair {G, C} where G is a context-free grammar whose productions are assigned labels from a finite set of labels II, and C (called the control set) is a set of strings over II. A derivation in a control grammar is similar to that in an ordinary context-free grammar except that the control set C is used to further constrain the set of valid derivations. In particular, if one views a derivation as a tree, then (in a manner to be described later) each edge in such a tree is given a label from II according to the production of G associated with the edge. The derivation tree is considered "valid" if certain paths in the tree correspond to strings which are in the control set C. The language generated by the control grammar is then the set of strings having at least one derivation tree in the sense just described.
منابع مشابه
A Two-Dimensional Hierarchy for Attributed Tree Transducers
Attributed tree transducers are formal models for studying properties of attribute grammars. In this paper we prove a two{dimen-sional hierarchy for classes of producing attributed tree transducers. The two dimensions refer to the maximum number of synthesized and inherited attributes, respectively. To this end we apply a pumping lemma for output languages of producing attributed tree transducers.
متن کاملStrictness of the Collapsible Pushdown Hierarchy
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author’s pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples that separate the levels of the collapsible pushdown graph hierarchy and of the collapsible pushdown tree hierarchy, i.e., the hierarchy of trees generated by ...
متن کاملReflection in the Chomsky Hierarchy
The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...
متن کاملA Pumping Lemma for Output Languages of Attributed Tree Transducers
The concept of attributed tree transducer is a formal model for studying properties of attribute grammars In this paper for output languages of noncircular producing and visiting attributed tree transducers we introduce and prove a pumping lemma We ap ply this pumping lemma to gain two results there is no noncircular producing and visiting attributed tree transducer which computes the set of al...
متن کاملA New Approach to Formal Language Theory by Kolmogorov Complexity
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate deterministic context-free languages and nondeterministic context-free languages. The use of the new ‘incompressibility arguments’ is illustrated by many examples. The ...
متن کامل