Showing papers on "Chomsky hierarchy published in 1975"

The New Grammarians' Funeral: A Critique of Noam Chomsky's Linguistics

Abstract: Preface Preface to the 1978 impression Works by Chomsky 1. 'The science of language' 2. Chomsky's grammar to the rescue 3. The limits of transformational-generative grammar 4. Chomsky's temptations and falls, or the strange tale of (i) The acquisition device (ii) Code (iii) Linguistic universals 5. The wild goose chase of meaning out of language: Chomskyan semantics I: universal concepts 6. Chomskyan semantics II: making propositions (i) Sense and logic (ii) Reference (iii) Absolute meaning (iv) The super-language Note: Chomsky's mistakes 7. Linguistics and philosophy: Chomsky's failure with Wittgenstein 8. Linguistics and everything else 9. 'The science of language' revisited Index.

On the syntactic structures of unrestricted grammars II. Automata

Abstract: We define a generalization of the finite state acceptors for derivation structures and for phrase structures. Corresponding to the Chomsky hierarchy of grammars, there is a hierarchy of acceptors, and for both kinds of structures, the type 2 acceptors are tree automata. For i = 0, 1, 2, 3, the sets of structures recognized by the type i acceptors are just the sets of projections of the structures of the type i grammars, and the languages of the type i acceptors are just the type i languages. Finally, we prove that the set of syntactic structures of a recursively enumerable language is recursive.

Developmental systems with interaction and fragmentation

Abstract: A new class of developmental systems with interaction is introduced, These systems are capable of splitting words into two or more separate parts. This property can be used to model reproduction processes and discarding parts of an organism. It is also of interest from the formal language theory point of view. This paper discusses the basic properties of the families of languages obtained, as well as their position with respect to other families of developmental languages and the families of the Chomsky hierarchy.

A grammatical characterization of exponential-time languages

Abstract: We show that the languages generated by a constrained form of Chomsky's transformational grammars characterize the languages recognized by Turing machines in deterministic exponential (2cn) time. The constraints on the transformational grammars are satisfied by many, though not all, known grammars in linguistic practice. We also give a simple algebraic characterization of the same class of languages and use it for the linguistic characterization.

Degree-languages, polynomial time recognition, and the LBA problem

Abstract: The 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 is one of the reasons why many attempts have been made to “refine” the original Chomsky classification. The main goal has been to describe languages which, for instance, are not context-free but are still context-sensitive, without using the powerful and complex concept of context-sensitive grammars.

An algebraic theory of formal languages

Abstract: : X ÷ A. This map extends to a homomorphism (uniquely) ~ : W~(X) ÷ A by induction as follows: (i) ~(x) = ~(x) for each xEX (2) ~(~(e I ..... en)) = ~A(~(e l) ..... ~(en)). We can use this idea to define composition of assignments. Let XI, X 2, X 3 ~ X and ~i : Xl ÷ W~(X2) and ~2 : X2 ÷ W~(X3) then we define ~2 o el(X) : ~2(~l(X)). Because of the unique extension property it is not difficult to verify that "o" is associative.

Recursive generation of local adjunct languages

Abstract: The local adjunct grammars and languages have been introduced by Joshi, Kosaraju, and Yamada in response to linguistic considerations. These grammars differ fundamentally from the Chomsky phrase-structure grammars, and they generate a distinct class of languages.