Linear iterated pushdowns

This paper discusses variants of nondeterministic one-way S-automata and context-free S-grammars where S is a storage type. The framework that these systems provide can be used to give alternative formulations of embedded pushdown automata and linear indexed grammars. The embedded pushdown automata is obtained by means of a linear version of a class of storage types called iterated pushdowns. Linear indexed grammar is obtained by using the pushdown storage type and restricting the way in which the grammar uses its storage

The equivalence of four extensions of context-free grammars

There is currently considerable interest among computational linguists in grammatical formalisms with highly restricted generative power. This paper concerns the relationship between the class of string languages generated by several such formalisms, namely, combinatory categorial grammars, head grammars, linear indexed grammars, and tree adjoining grammars. Each of these formalisms is known to generate a larger class of languages than context-free grammars. The four formalisms under consideration were developed independently and appear superficially to be quite different from one another. The result presented in this paper is that all four of the formalisms under consideration generate exactly the same class of string languages

Abstract Interpretation of Indexed Grammars.

Indexed grammars are a generalization of context-free grammars and recognize a proper subset of context-sensitive languages. The class of languages recognized by indexed grammars are called indexed languages and they correspond to the languages recognized by nested stack automata. For example indexed grammars can recognize the language {a^n b^n c^n | n > = 1} which is not context-free, but they cannot recognize {(ab^n)^n) | n >= 1} which is context-sensitive. Indexed grammars identify a set of languages that are more expressive than context-free languages, while having decidability results that lie in between the ones of context-free and context-sensitive languages. In this work we study indexed grammars in order to formalize the relation between indexed languages and the other classes of languages in the Chomsky hierarchy. To this end, we provide a fixpoint characterization of the languages recognized by an indexed grammar and we study possible ways to abstract, in the abstract interpretation sense, these languages and their grammars into context-free and regular languages

KRAS Mutations and Primary Resistance of Lung Adenocarcinomas to Gefitinib or Erlotinib

BACKGROUND: Somatic mutations in the gene for the epidermal growth factor receptor (EGFR) are found in adenocarcinomas of the lung and are associated with sensitivity to the kinase inhibitors gefitinib (Iressa) and erlotinib (Tarceva). Lung adenocarcinomas also harbor activating mutations in the downstream GTPase, KRAS, and mutations in EGFR and KRAS appear to be mutually exclusive. METHODS AND FINDINGS: We sought to determine whether mutations in KRAS could be used to further enhance prediction of response to gefitinib or erlotinib. We screened 60 lung adenocarcinomas defined as sensitive or refractory to gefitinib or erlotinib for mutations in EGFR and KRAS. We show that mutations in KRAS are associated with a lack of sensitivity to either drug. CONCLUSION: Our results suggest that treatment decisions regarding use of these kinase inhibitors might be improved by determining the mutational status of both EGFR and KRAS