This survey paper describes several extensions of context-free grammars as defined in the Chomsky hierarchy. These augmentations use a variety of different strategies to create grammars that generate all context-free and some context-sensitive languages. The basic concepts of each of these extensions will be examined, as well as whether the enhanced grammars inherited some of the desirable prop...

A new class of languages, called multi-push-down (mpd), that generalize the classical context-free (cf, or Chomsky type 2) ones is introduced. These languages preserve some important properties of cf languages: a generalization of the Chomsky-Schh utzenberger homomorphic characterization theorem, the Parikh theorem and a \pumping lemma" are proved. Multi-push-down languages are an AFL. Their re...

As many scholars have their own viewpoints and perspectives on Chomsky's universal grammar theory, this article shows recent developments in L2 learning by Chomsky. A significant turning point at the moment is UG approach to language education, particularly its values parameters. Many researchers argue that with SLA, has problems like Fries Palmer. They say there are linguistic variations make ...

Constituency grammars originated with Leonard Bloomfield (1933) and were developed during the nineteen forties and nineteen fifties by a number of American structuralist linguists, including Harris (1946) and Wells (1947) — to mention just two. In the late nineteen fifties, Chomsky (1957) suggested that constituency grammars could be formalized as context free grammars. It is now clear that con...

Numerical P systems are a class of P systems inspired both from the structure of living cells and from economics. Usually, they are used as devices for computing sets of numbers. In this work, we consider numerical P systems as language generators: symbols are associated with numbers (portions of the “production value”) sent to the environment. The generative capacity of such systems is investi...

In this paper we survey several aspects related to normal forms of hyperedge replacement grammars. Considering context free hyperedge replacement grammars we introduce, inspired by string grammars, Chomsky Normal Form and Greibach Normal Form. The algorithm of conversion is quite the same with the algorithm for string grammars. The important difference is related to the fact that hyperedge gram...

s: Melissa N. Hinman, Hui Zhu, Robert A. Hasman, Kavita Praveen, and Hua Lou. “Mammalian Hu protein family members have non-redundant functions as splicing suppressors”. Rustbelt RNA Meeting, Deer Creek State Park and Resort, Mt. Sterling, OH, October 19-20, 2007. Poster presentation.

Methodology in Linguistics, since the late 1950s, has largely followed the model put forward in Chomsky’s early adaptations of the Structuralist approach (Chomsky, 1957, 1965, 1966, 1975; Chomsky and Halle, 1968), though misapplication of the model has resulted in a methodological dichotomy not unlike that between the early Rationalist and Empiricist approaches to anatomy that emerged from Hipp...

In Manufacturing Consent: The Political Economy of the Mass Media, Noam Chomsky and I put forward a "propaganda model" as a framework for analysing and understanding how the mainstream U.S. media work and why they perform as they do (Herman and Chomsky 1988). We had long been impressed with the regularity with which the media operate on the basis of a set of ideological premises, depend heavily...

We introduce a fifth language accepting machine called the PDA-T, demonstrate some of its interesting formal properties, and show its role in the §-Calculus. Based upon this new machine and the §-Calculus’ other properties, we demonstrate the §-Calculus’ formal Turing Power, and then propose a formal language classification (the §-Hierarchy), derived largely from the Chomsky Hierarchy, but with...