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.
"synopsis" may belong to another edition of this title.
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).
"About this title" may belong to another edition of this title.
£ 2.95 shipping within United Kingdom
Destination, rates & speedsSeller: Prior Books Ltd, Cheltenham, United Kingdom
Paperback. Condition: Like New. First Edition. In nearly new condition: firm and square with strong joints, no creases. Just a few hardly noticeable rubs or very mild bumps. Hence a non-text page shows a small 'damaged' stamp. Despite such this book looks and feels unread. Thus the contents are crisp, fresh and tight. And so a very nice book in great condition, now offered for sale at a reasonable price. Seller Inventory # 203525
Quantity: 4 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 44866509-n
Quantity: Over 20 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 402. Seller Inventory # C9781009073783
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781009073783_new
Quantity: Over 20 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Seller Inventory # 402139868
Quantity: 3 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 254 pages. 9.00x6.00x0.56 inches. In Stock. This item is printed on demand. Seller Inventory # __1009073788
Quantity: 1 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 44866509
Quantity: Over 20 available
Seller: CitiRetail, Stevenage, United Kingdom
Paperback. Condition: new. Paperback. 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. Seller Inventory # 9781009073783
Quantity: 1 available
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. 200 Problems on Languages, Automata, and Computation 0.79. Book. Seller Inventory # BBS-9781009073783
Quantity: 5 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9781009073783
Quantity: Over 20 available