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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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).
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 5,14 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoLibrería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9781316513460_new
Cantidad disponible: Más de 20 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9781316513460
Cantidad disponible: Más de 20 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 530. Nº de ref. del artículo: C9781316513460
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 254 pages. 9.00x6.00x0.63 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __1316513467
Cantidad disponible: 1 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. New edition NO-PA16APR2015-KAP. Nº de ref. del artículo: 26396114345
Cantidad disponible: 4 disponibles
Librería: moluna, Greven, Alemania
Condición: 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 ref. del artículo: 756000384
Cantidad disponible: Más de 20 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand. Nº de ref. del artículo: 401311350
Cantidad disponible: 4 disponibles
Librería: CitiRetail, Stevenage, Reino Unido
Hardcover. Condición: 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 ref. del artículo: 9781316513460
Cantidad disponible: 1 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND. Nº de ref. del artículo: 18396114339
Cantidad disponible: 4 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 254 pages. 9.00x6.00x0.63 inches. In Stock. Nº de ref. del artículo: x-1316513467
Cantidad disponible: 2 disponibles