{"product_id":"techniques-for-searching-parsing-and-matching-9783030631918","title":"Techniques for Searching, Parsing, and Matching","description":"\u003cp\u003e\u003c\/p\u003e\u003cblockquote\u003eThe 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. \u003c\/blockquote\u003e\u003cp\u003e\u003cstrong\u003eFormat\u003c\/strong\u003e: Paperback \/ softback\u003cbr\u003e\u003cstrong\u003eLength\u003c\/strong\u003e: 310 pages\u003cbr\u003e\u003cstrong\u003ePublication date\u003c\/strong\u003e: 05 January 2023\u003cbr\u003e\u003cstrong\u003ePublisher\u003c\/strong\u003e: Springer Nature Switzerland AG\u003cbr\u003e\u003c\/p\u003e \u003cp\u003e\u003cbr\u003eThis 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.\u003cbr\u003e\u003cbr\u003eDesigned 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.\u003cbr\u003e\u003cbr\u003eBy 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.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eWeight\u003c\/strong\u003e: 610g\u003cbr\u003e\u003cstrong\u003eDimension\u003c\/strong\u003e: 254 x 178 (mm)\u003cbr\u003e\u003cstrong\u003eISBN-13\u003c\/strong\u003e: 9783030631918\u003cbr\u003e \u003cstrong\u003eEdition number\u003c\/strong\u003e: 1st ed. 2021\u003c\/p\u003e","brand":"Alberto Pettorossi","offers":[{"title":"Paperback \/ softback","offer_id":44264171045114,"sku":"9783030631918","price":45.8,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0522\/4297\/2845\/products\/noImage_1_e6baf5c7-add1-4f77-84d7-6d527c94d066.jpg?v=1685705287","url":"https:\/\/shulphink.com\/products\/techniques-for-searching-parsing-and-matching-9783030631918","provider":"Shulph Ink","version":"1.0","type":"link"}