Almost four decades have passed since "Formal Grammars "first appeared in 1974. At that time it was still possible to rather comprehensively review for (psycho)linguists the relevant literature on the theory of formal languages and automata, on their applications in linguistic theory and in the psychology of language. That is no longer feasible. In all three areas developments have been substantial, if not breathtaking. Nowadays, an interested linguist or psycholinguist opening any text on formal languages can no longer see the wood for the trees, as it is by no means evident which formal, mathematical tools are really required for natural language applications. An historical perspective can be helpful here. There are paths through the wood that have been beaten since decades; they can still provide useful orientation. The origins of these paths can be traced in the three volumes of "Formal Grammars," brought together in the present re-edition. In a newly added postscript the author has sketched what has become, after all these years, of formal grammars in linguistics and psycholinguistics, or at least some of the core developments. This chapter may provide further motivation for the reader to make a trip back to some of the historical sources.
Formal Languages and Applications provides a comprehensive study-aid and self-tutorial for graduates students and researchers. The main results and techniques are presented in an readily accessible manner and accompanied by many references and directions for further research. This carefully edited monograph is intended to be the gateway to formal language theory and its applications, so it is very useful as a review and reference source of information in formal language theory.
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.
The study of formal languages and of related families of automata has long been at the core of theoretical computer science. Until recently, the main reasons for this centrality were connected with the specification and analy sis of programming languages, which led naturally to the following ques tions. How might a grammar be written for such a language? How could we check whether a text were or were not a well-formed program generated by that grammar? How could we parse a program to provide the structural analysis needed by a compiler? How could we check for ambiguity to en sure that a program has a unique analysis to be passed to the computer? This focus on programming languages has now been broadened by the in creasing concern of computer scientists with designing interfaces which allow humans to communicate with computers in a natural language, at least concerning problems in some well-delimited domain of discourse. The necessary work in computational linguistics draws on studies both within linguistics (the analysis of human languages) and within artificial intelligence. The present volume is the first textbook to combine the topics of formal language theory traditionally taught in the context of program ming languages with an introduction to issues in computational linguistics. It is one of a series, The AKM Series in Theoretical Computer Science, designed to make key mathematical developments in computer science readily accessible to undergraduate and beginning graduate students.
Covers all areas, including operations on languages, context-sensitive languages, automata, decidability, syntax analysis, derivation languages, and more. Numerous worked examples, problem exercises, and elegant mathematical proofs. 1983 edition.