Introducing the Theory of Computation is the ideal text for introductory course on formal languages, automata, and computability. The author provides a concise, yet complete introduction to the important models of finite automata, grammars, and Turing machines, as well as undecidability and the basics of complexity theory. Numerous problems and programming exercises, varying in level of difficulty, round out each chapter and allow students to test themselves on key topics.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Wayne Goddard is currently as Associate Professor in the School of Computing at Clemson University having previously taught at the Universities of KwaZulu-Natal and Pennsylvania. His research interests are graph theory, algorithms, networks and combinatorics. He received his PhDs from the University of KwaZulu-Natal and the Massachusetts Institute of Technology. He has published over 100 journal and conference papers in many areas of graph theory as well as in graph algorithms, self-stabilizing algorithms, game-playing and ad hoc networks, and is co-author of a textbook on Research Methodology.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : World of Books (was SecondSale), Montgomery, IL, Etats-Unis
Paperback. Etat : Good. Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and an introduction to complexity theory. Solutions for selected exercises are included as an appendix. N° de réf. du vendeur 00108039180
Quantité disponible : 1 disponible(s)
Vendeur : World of Books Inc, Montgomery, IL, Etats-Unis
Paperback. Etat : Good. Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and an introduction to complexity theory. Solutions for selected exercises are included as an appendix. N° de réf. du vendeur CIN0763741256G
Quantité disponible : 1 disponible(s)
Vendeur : ThriftBooks-Phoenix, Phoenix, AZ, Etats-Unis
Hardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G0763741256I4N00
Quantité disponible : 1 disponible(s)
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
Hardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G0763741256I4N00
Quantité disponible : 1 disponible(s)
Vendeur : FirstClassBooks, Little Rock, AR, Etats-Unis
Etat : Good. Used books cannot guarantee unused access codes or working CD's! N° de réf. du vendeur HSU-OC-121-951
Quantité disponible : 4 disponible(s)
Vendeur : Keeps Books, Wilmington, IL, Etats-Unis
paperback. Etat : Good. Cover has light wear and used stickers on spine and rear. Text unmarked. Some pages are creased. Good solid binding. Ships Next Business Day. N° de réf. du vendeur 260824008
Quantité disponible : 1 disponible(s)
Vendeur : Textbook Bookie, Little Rock, AR, Etats-Unis
Paperback. Etat : Fair. Book in Fair condition. N° de réf. du vendeur 9780763741259-acceptable
Quantité disponible : 1 disponible(s)
Vendeur : GoldBooks, Denver, CO, Etats-Unis
Paperback. Etat : new. New Copy. Customer Service Guaranteed. N° de réf. du vendeur 67C88_46_0763741256
Quantité disponible : 1 disponible(s)
Vendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
Hardback. 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 GOR009572043
Quantité disponible : 1 disponible(s)