Alberto Pettorossi
Techniques for Searching, Parsing, and Matching
Techniques for Searching, Parsing, and Matching
💎 Earn 229 Points (£2.29) on this item.
YOU SAVE £9.19
- Condition: Brand new
- UK Delivery times: Usually arrives within 2 - 3 working days
- UK Shipping: Fee starts at £2.39. Subject to product weight & dimension
Bulk ordering. Want 15 or more copies? Get a personalised quote and bigger discounts. Learn more about bulk orders.
Couldn't load pickup availability
- More about Techniques for Searching, Parsing, and Matching
The author provides techniques for exploring trees and graphs, including linear search and backtracking, and algorithms for parsing subclasses of context-free languages, visiting trees, evaluating Boolean expressions, proving propositional formulas, computing paths in graphs, and string matching. It is used for advanced undergraduate and graduate courses on automata and formal languages.
Format: Paperback / softback
Length: 310 pages
Publication date: 05 January 2023
Publisher: Springer Nature Switzerland AG
This book delves into the realm of exploring trees and graphs, presenting a comprehensive collection of techniques and algorithms for traversing and manipulating these complex structures. The author begins by introducing the linear search technique and the backtracking technique, two fundamental methods for navigating trees and graphs. As examples of tree exploration methods, he presents a diverse range of algorithms tailored for parsing subclasses of context-free languages. Furthermore, the author showcases various tree and graph exploration and manipulation techniques through the presentation of algorithms for visiting trees, evaluating Boolean expressions, proving propositional formulas, computing paths in graphs, and performing string matching.
Designed for advanced undergraduate and graduate courses in automata and formal languages, this book assumes a foundational understanding of the basic concepts within this field. To enhance the learning experience, sample programs are provided in both Java and Prolog, allowing readers to apply the theoretical principles and implement practical solutions.
By exploring the intricacies of trees and graphs, this book equips readers with the skills and knowledge necessary to navigate and analyze these data structures effectively. Whether you are a computer science student, researcher, or professional seeking to expand your expertise in automata and formal languages, this book serves as a valuable resource for your journey into the world of computational complexity.
Weight: 610g
Dimension: 254 x 178 (mm)
ISBN-13: 9783030631918
Edition number: 1st ed. 2021
This item can be found in:
UK and International shipping information
UK and International shipping information
UK Delivery and returns information:
- Delivery within 2 - 3 days when ordering in the UK.
- Shipping fee for UK customers from £2.39. Fully tracked shipping service available.
- Returns policy: Return within 30 days of receipt for full refund.
International deliveries:
Shulph Ink now ships to Australia, Belgium, Canada, France, Germany, Ireland, Italy, India, Luxembourg Saudi Arabia, Singapore, Spain, Netherlands, New Zealand, United Arab Emirates, United States of America.
- Delivery times: within 5 - 10 days for international orders.
- Shipping fee: charges vary for overseas orders. Only tracked services are available for most international orders. Some countries have untracked shipping options.
- Customs charges: If ordering to addresses outside the United Kingdom, you may or may not incur additional customs and duties fees during local delivery.
