{"product_id":"9783031119644","title":"Undergraduate Topics in Computer Science: Fundamental Notions, Theorems, and Techniques","description":"\u003ch1\u003eUndergraduate Topics in Computer Science: Fundamental Notions, Theorems, and Techniques\u003c\/h1\u003e \u003ch2\u003ePettorossi, Alberto\u003c\/h2\u003e \u003cp\u003eKnowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general.\u003c\/p\u003e\u003cdiv\u003e\n\u003cp\u003e\u003c\/p\u003e\n\u003cp\u003ePresenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages.  The book also examines decidable and undecidable problems with emphasis on the case for context-free languages.\u003c\/p\u003e\n\u003cp\u003e\u003cb\u003eTopics and features:\u003c\/b\u003e\u003c\/p\u003e\n\u003cul\u003e\n\u003cli\u003eProvides theorems, examples, and exercises to clarify automata-languages correspondences\u003c\/li\u003e\n\u003cli\u003ePresents some fundamental techniques for parsing both regular and context-free languages\u003c\/li\u003e\n\u003cli\u003eClassifies subclasses of decidable problems, avoiding focus on the theory of complexity\u003c\/li\u003e\n\u003cli\u003eExamines finite-automata minimalization and characterization of their behavior using regular expressions\u003c\/li\u003e\n\u003cli\u003eIllustrates how to derive grammars of context-free languages in Chomsky and Greibach normal forms\u003c\/li\u003e\n\u003cli\u003eOffers supplementary material on counter machines, stack automata, and abstract language families\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003cp\u003e\u003c\/p\u003e\n\u003cp\u003e\u003c\/p\u003e\n\u003cp\u003e\u003c\/p\u003e\n\u003cp\u003e\u003c\/p\u003e\n\u003cp\u003e\u003c\/p\u003e\n\u003cp\u003e\u003c\/p\u003e\n\u003cp\u003eThis highly useful, varied text\/reference is suitable for undergraduate and graduatecourses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic.\u003c\/p\u003e\n\u003cp\u003e\u003cb\u003eAlberto Pettorossi\u003ci\u003e \u003c\/i\u003e\u003c\/b\u003eis professor of theoretical computer science at the University of Rome Tor Vergata, Rome, Italy.\u003c\/p\u003e\n\u003c\/div\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2022-08-13\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9783031119644\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-3-031-11965-1\u003c\/p\u003e \u003cp\u003eDimensions: 254cm x178cm\u003c\/p\u003e \u003cp\u003ePages: 280\u003c\/p\u003e ","brand":"Springer International Publishing","offers":[{"title":"Default Title","offer_id":44309238349964,"sku":"9783031119644","price":58.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783031119644.jpg?v=1775752400","url":"https:\/\/lateknightbooks.com\/products\/9783031119644","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}