Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger representation theorem. We present the proof which doesn't use any formal language theory tool at all except the representation theorem, just some linear algebra.

This paper explores specific issues concerning linguistic theory and the use of simplicity criteria in the early Transformational Generative Grammar literature. In particular, the influence of Nelson Goodman and Willard Van Orman Quine upon the work of Noam Chomsky during the 1950s is assessed. The main topics considered include the development of constructional system theory, the use of mechan...

El presente trabajo tiene por objetivo proponer un análisis crítico del debate entre Noam Chomsky y Michel Foucault a partir de las herramientas que proporciona el enfoque pragmadialéctico. En particular, se pretende contrastar conjunto etapas reglas discusión Frans van Eemeren Rob Grootendorst apuntan en su libro Una teoría sistemática la argumentación (2011) con antes mencionado para definir ...

We present a parsing algorithm for arbitrary context-free and probabilistic context-free grammars based on a representation of such grammars as a combination of a regular grammar and a grammar of balanced parentheses, similar to the representation used in the Chomsky-Schützenberger theorem. The basic algorithm has the same worst-case complexity as the popular CKY and Earley parsing algorithms f...

A string Turing machine is a variant of a Turing machine designed for easy manipulation of strings. In contrast to the standard Turing machine, a string Turing machine can insert and delete squares on the tape. It is easy to see that the models of standard and string Turing machines are equivalent in computing power. However, in case of the string Turing machine, imposing certain restrictions o...

There are several cases that occur in Class X, namely: 1) many students do not understand grammar because of the lack explanation detail and presented learning Book, 2) presentation textbook reduces value quantity textbook. The method used this study is a literature study, using qualitative descriptive method. research Data consisted four aspects, namely book Language, Language skills, vocabula...

Such WH-less WH-Questions (let us call them WLWQs) are very often used as questions in written tests or uttered by quizmasters in quizzes, though not often in daily conversations. 2 I assume that, despite their restriction in the range of registers, WLWQs are also constrained by the knowledge of human language. To my knowledge, there has been no previous research on WLWQs in the field. This pap...

Since Chomsky’s (1981) addition of the requirement that every sentence have a subject to the Projection Principle, the apparent stipulative nature of this constraint has been a source of worry for generative grammarians. The empirical basis of the Extended Projection Principle (EPP) is well-established but the external motivations for why Universal Grammar should contain such a requirement are ...