Handbook of Formal Languages
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Handbook of Formal Languages: Volume 3 Beyond Words
Handbook of Formal Languages: Volume 3 Beyond Words

Handbook of Formal Languages: Volume 3 Beyond Words


     0     
5
4
3
2
1



International Edition


X
About the Book

The need for a comprehensive survey-type exposition on formal languages and related mainstream areas of computer science has been evident for some years. In the early 1970s, when . the book Formal Languages by the second­ mentioned editor appeared, it was still quite feasible to write a comprehensive book with that title and include also topics of current research interest. This would not be possible anymore. A standard-sized book on formal languages would either have to stay on a fairly low level or else be specialized and restricted to some narrow sector of the field. The setup becomes drastically different in a collection of contributions, where the best authorities in the world join forces, each of them concentrat­ ing on their own areas of specialization. The present three-volume Handbook constitutes such a unique collection. In these three volumes we present the current state of the art in formal language theory. We were most satisfied with the enthusiastic response given to our request for contributions by specialists representing various subfields. The need for a Handbook of Formal Languages was in many answers expressed in different ways: as an easily accessible his­ torical reference, a general source of information, an overall course-aid, and a compact collection of material for self-study. We are convinced that the final result will satisfy such various needs. The theory of formal languages constitutes the stem or backbone of the field of science now generally known as theoretical computer science.

Table of Contents:
of Volume 3.- 1. Tree Languages.- 1. Introduction.- 2. Trees and terms.- 3. Algebraic preliminaries.- 4. Term rewriting systems.- 5. Finite tree recognizers.- 6. Regular tree grammars.- 7. Tree language operations and closure properties of Rec.- 8. Local tree languages.- 9. A Kleene theorem for tree languages.- 10. Regular tree systems.- 11. Algebraic characterizations of recognizability.- 12. Monadic second-order logic and regular tree languages.- 13. Families of special regular tree languages.- 14. The yield-function and context-free languages.- 15. Context-free tree grammars and pushdown tree recognizers.- 16. Tree transformations and tree transducers.- 17. Composition and decomposition of tree transformations.- 18. Tree transducers with regular look-ahead.- 19. Generalized syntax directed translations.- 20. Surface tree languages.- 21. The hierarchies of surface tree languages and transformational languages.- 22. Some further topics.- References.- 2. Tree-Adjoining Grammars.- 1. Introduction.- 2. Tree-adjoining grammars.- 3. Lexicalized grammars.- 4. ‘Lexicalization’ of CFGs.- 5. Closure of TAGs under lexicalization.- 6. Summary of lexicalization.- 7. Embedded push-down automaton (EPDA).- 8. Linguistic relevance.- 9. Some variants of TAGs.- 10. Parsing lexicalized tree-adjoining grammars (LTAG).- 11 Summary.- References.- 3. Context-Free Graph Grammars.- 1. Introduction.- 2. Node and edge replacement.- 3. Hyperedge replacement grammars.- 4. Node replacement grammars.- 5. Monadic second order logic.- 6. Graph grammars generating strings and trees.- 7. Tree grammars generating graphs.- References.- 4. Two-Dimensional Languages.- 1. Introduction.- 2. Preliminaries.- 3. Regular expressions.- 4. Automata.- 5. Grammars.- 6. Logic formulas.- 7. Tiling systems.- 8.Equivalence theorems.- 9. Properties of recognizable languages.- 10. Recognizable functions.- 11. Beyond finite state recognizability.- References.- 5. Basics of Term Rewriting.- 1. Introduction.- 2. Terms.- 3. Church—Rosser properties.- 4. Orderings.- 5. Completion.- 6. Rewriting modulo a relation.- 7. Sundries.- References and further reading.- 6. ?-Languages.- 1. Introduction.- 2. Topology for languages and ?-languages.- 3. The Chomsky hierarchy of ?-languages.- 4. Languages and ?-languages.- 5. Wagner’s hierarchy.- References.- 7. Languages, Automata, and Logic.- 1. Introduction.- 2. Models and formulas.- 3. Automata and MSO-logic on finite words and trees.- 4. First-order definability.- 5. Automata and MSO-logic on infinite words.- 6. Automata and MSO-logic on infinite trees.- References.- 8. Partial Commutation and Traces.- 1. Introduction.- 2. Free partially commutative monoids.- 3. Combinatorial properties.- 4. Recognizable trace languages.- 5. Rational trace languages.- 6. Dependence graphs and logic.- 7. Asynchronous automata.- 8. Infinite traces.- References.- 9. Visual Models of Plant Development.- 1. Introduction.- 2. Developmental models of plant architecture.- 3. Formal description of branching structures.- 4. Fundamentals of modeling using L-systems.- 5. Random factors in development.- 6. Life, death, and reproduction.- 7. Development controlled by endogenous mechanisms.- 8. Development controlled by exogenous mechanisms.- 9. Conclusions.- 10. Acknowledgements.- References.- 10. Digital Images and Formal Languages.- 1. Introduction.- 2. Black and white images and finite automata.- 3. Grayscale images and WFA.- 4. Weighted finite transducers.- 5. Examples of WFT.- References.


Best Sellers


Product Details
  • ISBN-13: 9783642638596
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 625
  • Returnable: N
  • Width: 155 mm
  • ISBN-10: 3642638597
  • Publisher Date: 29 Oct 2012
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Sub Title: Volume 3 Beyond Words


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Handbook of Formal Languages: Volume 3 Beyond Words
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Handbook of Formal Languages: Volume 3 Beyond Words
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Handbook of Formal Languages: Volume 3 Beyond Words

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!