Formal languages and automata have long been fundamental to theoretical computer science, but students often struggle to understand these concepts in the abstract. This book provides a rich source of compelling exercises designed to help students grasp the subject intuitively through practice. The text covers important topics such as finite automata, regular expressions, push-down automata, grammars, and Turing machines via a series of problems of increasing difficultly. Problems are organised by topic, many with multiple follow-ups, and each section begins with a short recap of the basic notions necessary to make progress. Complete solutions are given for all exercises, making the book well suited for self-study as well as for use as a course supplement. Developed over the course of the editors' two decades of experience teaching the acclaimed Automata, Formal Languages, and Computation course at the University of Warsaw, it is an ideal resource for students and instructors alike.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Filip Murlak is Associate Professor at the University of Warsaw, where he lectures on automata, complexity, logic, and databases. His publications include the books Relational and XML Data Exchange (2010) and Foundations of Data Exchange (2014).
Damian Niwiński is Professor at the University of Warsaw, where he lectures on automata theory, languages and computations, complexity, algorithmic game theory, and information theory. His publications include the monograph Rudiments of Mu-calculus (with A. Arnold, 2001).
Wojciech Rytter is Professor at the University of Warsaw and a member of the Academia Europaea. He is the author of a large number of publications on automata, formal languages, parallel computing and text algorithms. He is a co-author of several books, including Efficient parallel algorithms (1987), Text algorithms (1994) and 125 Exercises in Text Algorithms (2021).
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 4,67 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisVendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781316513460_new
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9781316513460
Quantité disponible : Plus de 20 disponibles
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 530. N° de réf. du vendeur C9781316513460
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 254 pages. 9.00x6.00x0.63 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __1316513467
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. InhaltsverzeichnisPart I. Problems: 1. Words, numbers, graphs 2. Regular languages 3. Context-free languages 4. Theory of computation Part II. Solutions: 1. Words, numbers, graphs 2. Regular languages 3. Context-free languages 4. . N° de réf. du vendeur 756000384
Quantité disponible : Plus de 20 disponibles
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. N° de réf. du vendeur 18396114339
Quantité disponible : 3 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. New edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26396114345
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 401311350
Quantité disponible : 4 disponible(s)
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Hardcover. Etat : new. Hardcover. Formal languages and automata have long been fundamental to theoretical computer science, but students often struggle to understand these concepts in the abstract. This book provides a rich source of compelling exercises designed to help students grasp the subject intuitively through practice. The text covers important topics such as finite automata, regular expressions, push-down automata, grammars, and Turing machines via a series of problems of increasing difficultly. Problems are organised by topic, many with multiple follow-ups, and each section begins with a short recap of the basic notions necessary to make progress. Complete solutions are given for all exercises, making the book well suited for self-study as well as for use as a course supplement. Developed over the course of the editors' two decades of experience teaching the acclaimed Automata, Formal Languages, and Computation course at the University of Warsaw, it is an ideal resource for students and instructors alike. This book presents a series of compelling exercises of increasing difficulty in formal languages, automata and computation, key topics in theoretical computer science. Comprehensive solutions are provided for all problems, making it a perfect resource for self-study, as well as a source of examples and problems for instructors. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9781316513460
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 254 pages. 9.00x6.00x0.63 inches. In Stock. N° de réf. du vendeur x-1316513467
Quantité disponible : 2 disponible(s)