Bibliografie

Detailansicht

Introduction to Formal Grammars

ISBN/EAN: 9783642871313
Umbreit-Nr.: 4149497

Sprache: Englisch
Umfang: xii, 231 S.
Format in cm:
Einband: kartoniertes Buch

Erschienen am 29.03.2012
Auflage: 1/1970
€ 53,49
(inklusive MwSt.)
Lieferbar innerhalb 1 - 2 Wochen
  • Zusatztext
    • The present work originates in a course given by the authors during the last few years in various university departments and institutions, among which we should like to mention: the Centre de Linguistique Quantitative of the Faculte des Sciences de Paris, created at the instance of the late Professor Favard; the Chaire d'Analyse Numerique of the Faculte des Sciences de Paris (Professor Rene de Possel), curriculum of Troisieme Cycle; the Chaire de Physique Mathematique of the University of Toulouse (Professor M. Laudet), for the degree DiplOme d'Etudes Approfondies in the section "Traitement de I'Information"; the department 1 of linguistics of the University of Pennsylvania (Professor Z. S. Harris); Institut de Programmation of the Faculte des Sciences de Paris for the troisieme niveau. the courses in the Written for purely didactic purposes, this Introduction to Formal Grammars makes no pretense to any scientific originality. Large portions of it have been borrowed from the fundamental and "classic" works cited in the bibliography, such as that of M. Davis, Computability and Unsolvability [9], and those of N. Chomsky, among others Formal Properties of Grammars [6]. Ineluctably, there are numerous borrowings made during a course, and the authors would like to acknowledge their debt to J. Pitrat for his lectures given in the Centre de Linguistique Quantitative mentioned above, and to M. Nivat for his work in connection 2 and transduction.

  • Leseprobe
    • InhaltsangabeI Logical and Algebraic Preliminaries.- I Words - Monoids - Languages.- II. General Definition of Formal Systems.- III. Combinatorial Systems.- IV. Algorithms - Turing Machines.- V. Computability - Decidability.- VI. Combinatorial Systems and Turing Machines; Undecidable Problems.- II Some Important Classes of Languages.- VII. Context-Free Languages.- VIII. Undecidable Properties of CF-Grammars.- IX. Push-Down Automata.- X. Kleene Languages and Finite Automata.- XI. Languages Defined by Systems of Equations.- XII. Context-Sensitive Grammars. Linear Bounded Automata.- III The Algebraic Point of View.- XIII. Homomorphisms of Monoids.- XIV. More about Kleene Languages.- XV. More about Context-Free Languages.- XVI. Algebraic Languages.- Transformational Grammars.- Bibliography of Transformational Grammars.- Annotated Bibliography.
Lädt …