AUTOMATA COMPUTABILITY AND COMPLEXITY

 
9788131788226: AUTOMATA COMPUTABILITY AND COMPLEXITY
Vedi tutte le copie di questo ISBN:
 
 

International economy Edition (book content & author is the same as original EDITION). PAPERBACK. Global shipping, item shipped right away using DHL/FEDEX and item delivery assured in 4-6 business days. NEW GOOD PRINT. Publisher: PEARSON.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

I migliori risultati di ricerca su AbeBooks

1.

ELAINE A RICH
Editore: PEARSON INDIA (2012)
ISBN 10: 8131788229 ISBN 13: 9788131788226
Nuovo Soft cover Quantità: 1
Da
Books in my Basket
(New Delhi, India)
Valutazione libreria

Descrizione libro PEARSON INDIA, 2012. Soft cover. Condizione: New. Codice articolo 1165582

Informazioni sul venditore | Contattare il venditore

Compra nuovo
EUR 12,80
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 12,90
Da: India a: U.S.A.
Destinazione, tempi e costi

2.

ELAINE A RICH
Editore: PEARSON INDIA (2012)
ISBN 10: 8131788229 ISBN 13: 9788131788226
Nuovo Softcover Quantità: 1
Da
BookVistas
(New Delhi, India)
Valutazione libreria

Descrizione libro PEARSON INDIA, 2012. Softcover. Condizione: New. Codice articolo Adhya-9788131788226

Informazioni sul venditore | Contattare il venditore

Compra nuovo
EUR 16,70
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 11,99
Da: India a: U.S.A.
Destinazione, tempi e costi

3.

ELAINE A RICH
Editore: PEARSON INDIA (2012)
ISBN 10: 8131788229 ISBN 13: 9788131788226
Nuovo Softcover Quantità: 1
Da
Vikram Jain Books
(New Delhi, India)
Valutazione libreria

Descrizione libro PEARSON INDIA, 2012. Softcover. Condizione: New. Codice articolo Adhya-9788131788226

Informazioni sul venditore | Contattare il venditore

Compra nuovo
EUR 16,70
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 11,99
Da: India a: U.S.A.
Destinazione, tempi e costi
Edizione Internazionale
Edizione Internazionale

4.

ELAINE A RICH
ISBN 10: 8131788229 ISBN 13: 9788131788226
Nuovo Paperback Quantità: 2
Edizione Internazionale
Da
Bookstore99
(Wilmington, DE, U.S.A.)
Valutazione libreria

Descrizione libro Paperback. Condizione: NEW. International Edition, Brand New, ISBN and Cover same but contents similar to U.S. Edition, Printed in Black & White. End Chapter Exercises may differ. No CD/Access code. Legal to use despite any disclaimer, We ship to PO , APO and FPO adresses in U.S.A .Choose Expedited Shipping for FASTER DELIVERY.Customer Satisfaction Guaranteed. Codice articolo IN_9788131788226

Informazioni sul venditore | Contattare il venditore

Compra nuovo
EUR 32,99
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

5.

Elaine A. Rich
Editore: Pearson Education (2012)
ISBN 10: 8131788229 ISBN 13: 9788131788226
Nuovo Softcover Prima edizione Quantità: 5
Da
BookVistas
(New Delhi, India)
Valutazione libreria

Descrizione libro Pearson Education, 2012. Softcover. Condizione: New. First edition. CONTENTS: PART I: INTRODUCTION 1. Why Study Automata Theory? 2. Languages and Strings 3. The Big Picture: A Language Hierarchy 4. Computation PART II: FINITE STATE MACHINES AND REGULAR LANGUAGES 5. Finite State Machines 6. Regular Expressions 7. Regular Grammars 8. Regular and Nonregular Languages 9. Algorithms and Decision Procedures for Regular Languages 10. Summary and References PART III: CONTEXT-FREE LANGUAGES AND PUSHDOWN AUTOMATA 11. Context-Free Grammars 12. Pushdown Automata 13. Context-Free and Noncontext-Free Languages 14. Algorithms and Decision Procedures for Context-Free Languages 15. Context-Free Parsing 16. Summary and References PART IV: TURING MACHINES AND UNDECIDABILITY 17. Turing Machines 18. The Church-Turing Thesis 19. The Unsolvability of the Halting Problem 20. Decidable and Semidecidable Languages 21. Decidability and Undecidability Proofs 22. Undecidable Languages That Do Not Ask Questions about Turing Machines 23. Unrestricted Grammars 24. The Chomsky Hierarchy and Beyond 25. Computable Functions 26. Summary and References Part V: Complexity 27. Introduction to the Analysis of Complexity 28. Time Complexity Classes 29. Space Complexity Classes 30. Practical Solutions for Hard Problems 31. Summary and References Appendices A: Review of Mathematical Background: Logic, Sets, Relations, Functions, and Proof Techniques B: The Theory: Working with Logical Formulas C: The Theory: Finite State Machines and Regular Languages D: The Theory: Context-Free Languages and PDAs E: The Theory: Turing Machines and Undecidability F: The Theory: Complexity Appendices G-Q: Applications G: Applications: Programming Languages and Compilers H: Applications: Tools for Programming, database and Software Engineering I: Applications: Networks J: Applications: Security K: Applications: Computational Biology L: Applications: Natural Language Processing M: Applications: Artificial Intelligence and Computational Reasoning N: Applications: Art and Environment: Music and Games O: Applications: Using Regular Expressions P: Applications: Using Finite State Machines and Transducers Q: Applications: Using Grammars Printed Pages: 1120. Codice articolo 69432

Informazioni sul venditore | Contattare il venditore

Compra nuovo
EUR 21,06
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 11,99
Da: India a: U.S.A.
Destinazione, tempi e costi

6.

Elaine A. Rich
Editore: Pearson Education (2012)
ISBN 10: 8131788229 ISBN 13: 9788131788226
Nuovo Softcover Prima edizione Quantità: 5
Da
Vikram Jain Books
(New Delhi, India)
Valutazione libreria

Descrizione libro Pearson Education, 2012. Softcover. Condizione: New. First edition. CONTENTS: PART I: INTRODUCTION 1. Why Study Automata Theory? 2. Languages and Strings 3. The Big Picture: A Language Hierarchy 4. Computation PART II: FINITE STATE MACHINES AND REGULAR LANGUAGES 5. Finite State Machines 6. Regular Expressions 7. Regular Grammars 8. Regular and Nonregular Languages 9. Algorithms and Decision Procedures for Regular Languages 10. Summary and References PART III: CONTEXT-FREE LANGUAGES AND PUSHDOWN AUTOMATA 11. Context-Free Grammars 12. Pushdown Automata 13. Context-Free and Noncontext-Free Languages 14. Algorithms and Decision Procedures for Context-Free Languages 15. Context-Free Parsing 16. Summary and References PART IV: TURING MACHINES AND UNDECIDABILITY 17. Turing Machines 18. The Church-Turing Thesis 19. The Unsolvability of the Halting Problem 20. Decidable and Semidecidable Languages 21. Decidability and Undecidability Proofs 22. Undecidable Languages That Do Not Ask Questions about Turing Machines 23. Unrestricted Grammars 24. The Chomsky Hierarchy and Beyond 25. Computable Functions 26. Summary and References Part V: Complexity 27. Introduction to the Analysis of Complexity 28. Time Complexity Classes 29. Space Complexity Classes 30. Practical Solutions for Hard Problems 31. Summary and References Appendices A: Review of Mathematical Background: Logic, Sets, Relations, Functions, and Proof Techniques B: The Theory: Working with Logical Formulas C: The Theory: Finite State Machines and Regular Languages D: The Theory: Context-Free Languages and PDAs E: The Theory: Turing Machines and Undecidability F: The Theory: Complexity Appendices G-Q: Applications G: Applications: Programming Languages and Compilers H: Applications: Tools for Programming, database and Software Engineering I: Applications: Networks J: Applications: Security K: Applications: Computational Biology L: Applications: Natural Language Processing M: Applications: Artificial Intelligence and Computational Reasoning N: Applications: Art and Environment: Music and Games O: Applications: Using Regular Expressions P: Applications: Using Finite State Machines and Transducers Q: Applications: Using Grammars Printed Pages: 1120. Codice articolo 69432BV

Informazioni sul venditore | Contattare il venditore

Compra nuovo
EUR 21,06
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 11,99
Da: India a: U.S.A.
Destinazione, tempi e costi