Handbook of Formal Languages: Volume 3. Beyond Words [Hardcover]

Grzegorz Rozenberg (Editor), Arto Salomaa (Editor)

Book Description

Publication Date: May 28, 2002

This third volume of the Handbook of Formal Languages discusses language theory beyond linear or string models: trees, graphs, grids, pictures, computer graphics. Many chapters offer an authoritative self-contained exposition of an entire area. Special emphasis is on interconnections with logic.

Product Details

• Hardcover: 625 pages
• Publisher: Springer; 1 edition (May 28, 2002)
• Language: English
• ISBN-10: 3540606491
• ISBN-13: 978-3540606499
• Product Dimensions: 9.5 x 6.4 x 1.2 inches
• Shipping Weight: 2.4 pounds
• Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #1,147,293 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

4 of 4 people found the following review helpful:

5.0 out of 5 stars Brings together three themes with interesting side trips., July 26, 2004

By 

J. COLBY "CS Ph.D. survivor [with amnesia]" (Santa Cruz, CA USA) - See all my reviews
(REAL NAME)   

This review is from: Handbook of Formal Languages: Volume 3. Beyond Words (Hardcover)

As a Ph.D. candidate working in parsing and interested in model-theoretic syntax, I have found this book to be very useful. I have become very interested in the relation between languages, automata and logic, and how they relate to parsing and deduction. This handbook presents these things with some extra tidbits in chapters which from what I have read - I haven't read the whole book - are well-written and accessible. And the authors point out connections between each other's work.

What is especially interesting to me is the focus on languages where the chosen models are not strings, but instead trees, graphs, etc. For example, my present work is about semiring parsing, with tree automata as the operational model. I am interested in applying parsing as deduction to models which are arbitrary classes of graphs described by grammars written as formulas in some logic. Having recently bought this handbook for future reference, I was delighted to find a very accessible and useful chapter on tree automata which related to work I just started.

For my interests, the chapters on graph grammars, term rewriting and on automata, languages and logic are also enticing and I look forward to reading them as well. The other chapters aren't central to my own work, but I also look forward to reading them, for they seem interesting.

I encourage any researcher working with languages, whether they be artificial ones like XML trees, graphs representing networks or proofs, or they are natural languages, who would like to enter the new millenium to read this book as well as the other volumes of the Handbook of Formal Languages.