An Introduction to Formal Languages and Automata, Seventh Edition is designed for an introductory course on formal languages, automata, computability, and related matters forming what is known as the theory of computation. The text takes a problem-solving approach, in which students' abilities are tested at various levels. The Seventh Edition familiarizes students with the foundations and principles of computer science, teaches material useful in subsequent courses, and strengthens students' ability to carry out formal and rigorous mathematical arguments. New Introductory Exercises help to bridge concepts to more difficult exercises Chapters 1-14 of the sixth edition, with the new exercises, are now reorganized as Part I: Theory NEW - Three NEW chapters on parsing are included in a new section, Part 2: Applications, and focus on how to apply theory from previous chapters into the real worldThe accessible approach allows student to clearly understand key content while retaining the appropriate mathematical notations and theorems required for the courseCentral ideas are preceded by a motivating example, drawn from applications, that introduces the concept and illustrates its usefulness (c) 2023 572 pages
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Peter Linz, Professor Emeritus, University of California, Davis Peter Linz is Professor Emeritus in the Department of Computer Science at the University of California, Davis.'Linz received his Ph.D. from the University of Wisconsin.'Professor Linz's research emphasizes the development of a theory of numerical analysis that can be used in the construction of reliable numerical methods used in the design of problem-solving environments for scientific computing.'Linz has released the seventh edition of An Introduction to Formal Languages and Automata, as well as Exploring Numerical Methods: An Introduction to Scientific Computing.'
Susan H. Rodger is Professor of the Practice of Computer Science at Duke University. She received her Ph.D. in Computer Science from Purdue University. Rodger works in the area of computer science education. Her major contributions are in visualization and interaction software for education in theoretical computer science, computing in K-12 and peer-led team learning. Rodger developed JFLAP, software for experimenting with formal languages and automata. JFLAP is the leading educational tool for formal languages and automata theory and has been used around the world for over thirty years in several types of courses including formal languages and automata, compilers, artificial intelligence, and discrete mathematics. Rodger is a leader in integrating computing into K-12 with the Adventures in Alice Programming project. Rodger received the IEEE Computer Society 2019 Taylor L. Booth Education Award, ACM 2013 Karl V. Karlstrom Outstanding Educator Award, Duke University Trinity College 2019 David and Janet Vaughn Brooks Distinguished Teaching Award, and she was one of two finalist candidates for the NEEDS Premier Award for Excellence in Engineering Education Courseware for the software JFLAP.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 8,65 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisEUR 17,09 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
Paperback. Etat : Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. N° de réf. du vendeur GOR014399584
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. N° de réf. du vendeur 44381430-5
Quantité disponible : 20 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 44381430-n
Quantité disponible : 2 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. 2022. 7th Edition. Paperback. . . . . . N° de réf. du vendeur V9781284231601
Quantité disponible : Plus de 20 disponibles
Vendeur : TextbookRush, Grandview Heights, OH, Etats-Unis
Etat : Very Good. All orders ship SAME or NEXT business day. Expedited shipments will be received in 1-5 business days within the United States. We proudly ship to APO/FPO addresses. 100% Satisfaction Guaranteed! N° de réf. du vendeur 48156556
Quantité disponible : 3 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781284231601_new
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 44381430
Quantité disponible : 2 disponible(s)
Vendeur : Textbooks_Source, Columbia, MO, Etats-Unis
paperback. Etat : Good. 7th Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). N° de réf. du vendeur 006653944U
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 44381430
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Kartoniert / Broschiert. Etat : New. Über den AutorPeter Linz, Professor Emeritus, University of California, DavisPeter Linz is Professor Emeritus in the Department of Computer Science at the University of California, Davis.Linz received his Ph.D. from the University o. N° de réf. du vendeur 527384630
Quantité disponible : 1 disponible(s)