{"product_id":"automata-theory-and-formal-languages-fundamental-notions-theorems-and-techniques-9783031119644","title":"Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques","description":"\u003cp\u003e • Author(s): Alberto Pettorossi\u003cbr\u003e • Publisher: Springer Verlag\u003cbr\u003e • Publisher Imprint: Springer\u003cbr\u003e • Subject: Computer Science and Information Technology\u003cbr\u003e • BISAC: Logic\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003cb\u003eFrom the Back Cover\u003c\/b\u003e\u003cbr\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\u003cp\u003e\u003c\/p\u003e \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 \u003cp\u003e\u003cb\u003eTopics and features: \u003c\/b\u003e\u003c\/p\u003e\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\u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e \u003cp\u003e\u003c\/p\u003e \u003cp\u003eThis highly useful, varied text\/reference is suitable for undergraduate and graduate courses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic.\u003c\/p\u003e \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","brand":"Springer","offers":[{"title":"Paperback","offer_id":45277784768663,"sku":"9783031119644","price":4040.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9783031119644_797f0966-616c-45ff-bbc9-92829aec02b0.jpg?v=1741372303","url":"https:\/\/atlanticbooks.com\/products\/automata-theory-and-formal-languages-fundamental-notions-theorems-and-techniques-9783031119644","provider":"Atlantic Books","version":"1.0","type":"link"}