Readings Newsletter
Become a Readings Member to make your shopping experience even easier.
Sign in or sign up for free!
You’re not far away from qualifying for FREE standard shipping within Australia
You’ve qualified for FREE standard shipping within Australia
The cart is loading…

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
This volume contains the proceedings of the 15th Spring School of the LITP (Laboratoire d'Informatique Theorique et de Programmation, Universite Paris VI-VII, CNRS) held from May 25 to 29, 1987 in Saint-Pierre d'Oleron. The meeting was organized by M. Borillo, M. Gross, M. Nivat and D. Perrin. The purpose of this yearly meeting is to present the state of the art in a specific topic which has gained considerable maturity. The proceedings of the last three Spring Schools have already been published in this series and deal with Automata on Infinite Words (LNCS 192), Combinators and Functional Programming Languages
(LNCS 242) and Automata Networks (LNCS 316). The contributions gathered for the 1987 conference present a unique combination of automata theory on the one hand and natural language processing on the other hand. Both fields have strong historical links as exemplified by the works of Chomsky and Harris in Linguistics, the work of Backus and others in Computer Science and the work of Schutzenberger in Algebra. The methods described and discussed in the field of string processing and automata cover the traditional algorithms for string matching, data compression, sequence comparison and lexical analysis. The papers that deal more directly with natural language processing treat automated text generation, lexical analysis and formal representation.
$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout
Stock availability can be subject to change without notice. We recommend calling the shop or contacting our online team to check availability of low stock items. Please see our Shopping Online page for more details.
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
This volume contains the proceedings of the 15th Spring School of the LITP (Laboratoire d'Informatique Theorique et de Programmation, Universite Paris VI-VII, CNRS) held from May 25 to 29, 1987 in Saint-Pierre d'Oleron. The meeting was organized by M. Borillo, M. Gross, M. Nivat and D. Perrin. The purpose of this yearly meeting is to present the state of the art in a specific topic which has gained considerable maturity. The proceedings of the last three Spring Schools have already been published in this series and deal with Automata on Infinite Words (LNCS 192), Combinators and Functional Programming Languages
(LNCS 242) and Automata Networks (LNCS 316). The contributions gathered for the 1987 conference present a unique combination of automata theory on the one hand and natural language processing on the other hand. Both fields have strong historical links as exemplified by the works of Chomsky and Harris in Linguistics, the work of Backus and others in Computer Science and the work of Schutzenberger in Algebra. The methods described and discussed in the field of string processing and automata cover the traditional algorithms for string matching, data compression, sequence comparison and lexical analysis. The papers that deal more directly with natural language processing treat automated text generation, lexical analysis and formal representation.