Formal Languages and Computation

Formal Languages and Computation

by Alexander Meduna
Released February 2014
Publisher(s): Auerbach Publications
ISBN: 9781466513495

Read it now on the O’Reilly learning platform with a 10-day free trial.

O’Reilly members get unlimited access to books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial

Book description

This computer science book gives a clear, comprehensive introduction to formal language theory and its applications in computer science. It is meant as the basis of a one-term course on this subject at the undergraduate level. It covers all rudimental topics concerning formal languages and their models, especially grammars and automata. It sketches the basic ideas underlying the theory of computation, including computability, decidability, and computational complexity. From a practical viewpoint, it explains how these models underlie computer science engineering techniques for language processing, such as lexical and syntax analysis.

Table of contents

  1. Front Cover (1/2)
  2. Front Cover (2/2)
  3. Contents (1/2)
  4. Contents (2/2)
  5. Preface
  6. Acknowledgments
  7. Author
  8. Chapter 1: Mathematical Background (1/2)
  9. Chapter 1: Mathematical Background (2/2)
  10. Chapter 2: Formal Languages and Rewriting Systems (1/4)
  11. Chapter 2: Formal Languages and Rewriting Systems (2/4)
  12. Chapter 2: Formal Languages and Rewriting Systems (3/4)
  13. Chapter 2: Formal Languages and Rewriting Systems (4/4)
  14. Chapter 3: Models for Regular Languages (1/6)
  15. Chapter 3: Models for Regular Languages (2/6)
  16. Chapter 3: Models for Regular Languages (3/6)
  17. Chapter 3: Models for Regular Languages (4/6)
  18. Chapter 3: Models for Regular Languages (5/6)
  19. Chapter 3: Models for Regular Languages (6/6)
  20. Chapter 4: Applications of Regular Expressions and Finite Automata: Lexical Analysis (1/3)
  21. Chapter 4: Applications of Regular Expressions and Finite Automata: Lexical Analysis (2/3)
  22. Chapter 4: Applications of Regular Expressions and Finite Automata: Lexical Analysis (3/3)
  23. Chapter 5: Properties of Regular Languages (1/3)
  24. Chapter 5: Properties of Regular Languages (2/3)
  25. Chapter 5: Properties of Regular Languages (3/3)
  26. Chapter 6: Models for Context-Free Languages (1/10)
  27. Chapter 6: Models for Context-Free Languages (2/10)
  28. Chapter 6: Models for Context-Free Languages (3/10)
  29. Chapter 6: Models for Context-Free Languages (4/10)
  30. Chapter 6: Models for Context-Free Languages (5/10)
  31. Chapter 6: Models for Context-Free Languages (6/10)
  32. Chapter 6: Models for Context-Free Languages (7/10)
  33. Chapter 6: Models for Context-Free Languages (8/10)
  34. Chapter 6: Models for Context-Free Languages (9/10)
  35. Chapter 6: Models for Context-Free Languages (10/10)
  36. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (1/12)
  37. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (2/12)
  38. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (3/12)
  39. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (4/12)
  40. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (5/12)
  41. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (6/12)
  42. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (7/12)
  43. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (8/12)
  44. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (9/12)
  45. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (10/12)
  46. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (11/12)
  47. Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis (12/12)
  48. Chapter 8: Properties of Context-Free Languages (1/3)
  49. Chapter 8: Properties of Context-Free Languages (2/3)
  50. Chapter 8: Properties of Context-Free Languages (3/3)
  51. Chapter 9: Turing Machines and Their Variants (1/3)
  52. Chapter 9: Turing Machines and Their Variants (2/3)
  53. Chapter 9: Turing Machines and Their Variants (3/3)
  54. Chapter 10: Applications of Turing Machines: Theory of Computation (1/7)
  55. Chapter 10: Applications of Turing Machines: Theory of Computation (2/7)
  56. Chapter 10: Applications of Turing Machines: Theory of Computation (3/7)
  57. Chapter 10: Applications of Turing Machines: Theory of Computation (4/7)
  58. Chapter 10: Applications of Turing Machines: Theory of Computation (5/7)
  59. Chapter 10: Applications of Turing Machines: Theory of Computation (6/7)
  60. Chapter 10: Applications of Turing Machines: Theory of Computation (7/7)
  61. Chapter 11: Turing Machines and General Grammars (1/4)
  62. Chapter 11: Turing Machines and General Grammars (2/4)
  63. Chapter 11: Turing Machines and General Grammars (3/4)
  64. Chapter 11: Turing Machines and General Grammars (4/4)
  65. Chapter 12: Concluding and Bibliographical Remarks (1/2)
  66. Chapter 12: Concluding and Bibliographical Remarks (2/2)
  67. Appendix I: Index to Special Symbols
  68. Appendix II: Index to Language Models
  69. References (1/2)
  70. References (2/2)
  71. Bibliography (1/2)
  72. Bibliography (2/2)
  73. Back Cover

Product information

  • Title: Formal Languages and Computation
  • Author(s): Alexander Meduna
  • Release date: February 2014
  • Publisher(s): Auerbach Publications
  • ISBN: 9781466513495