| Description |
1 online resource |
| Note |
Title from content provider. |
| Summary |
Annotation Formal Languages and Computation: Models and Their Applications gives a clear, comprehensive introduction to formal language theory and its applications in computer science. It covers all rudimental topics concerning formal languages and their models, especially grammars and automata, and sketches the basic ideas underlying the theory of computation, including computability, decidability, and computational complexity. Emphasizing the relationship between theory and application, the book describes many real-world applications, including computer science engineering techniques for language processing and their implementation. Covers the theory of formal languages and their models, including all essential concepts and properties Explains how language models underlie language processors Pays a special attention to programming language analyzers, such as scanners and parsers, based on four language models--regular expressions, finite automata, context-free grammars, and pushdown automata Discusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedure Reviews the general theory of computation, particularly computability and decidability Considers problem-deciding algorithms in terms of their computational complexity measured according to time and space requirements Points out that some problems are decidable in principle, but they are, in fact, intractable problems for absurdly high computational requirements of the algorithms that decide them In short, this book represents a theoretically oriented treatment of formal languages and their models with a focus on their applications. It introduces all formalisms concerning them with enough rigors to make all results quite clear and valid. Every complicated mathematical passage is preceded by its intuitive explanation so that even the most complex parts of the book are easy to grasp. After studying this book, both student and professional should be able to understand the fundamental theory of formal languages and computation, write language processors, and confidently follow most advanced books on the subject. |
| Contents |
Front Cover; Contents; Preface; Acknowledgments; Author; Chapter 1: Mathematical Background; Chapter 2: Formal Languages and Rewriting Systems; Chapter 3: Models for Regular Languages; Chapter 4: Applications of Regular Expressions and Finite Automata: Lexical Analysis; Chapter 5: Properties of Regular Languages; Chapter 6: Models for Context-Free Languages; Chapter 7: Applications of Models for Context-Free Languages: Syntax Analysis; Chapter 8: Properties of Context-Free Languages; Chapter 9: Turing Machines and Their Variants. |
|
Chapter 10: Applications of Turing Machines: Theory of ComputationChapter 11: Turing Machines and General Grammars; Chapter 12: Concluding and Bibliographical Remarks; Appendix I: Index℗ to℗ Special Symbols; Appendix II: Index to Language Models; References; Bibliography; Back Cover. |
| Bibliography |
Includes bibliographical references and index. |
| Access |
Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK). WlAbNL |
| Terms Of Use |
Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force. WlAbNL |
| Subject |
Formal languages.
|
|
Machine theory.
|
|
Langages formels. |
|
Théorie des automates. |
|
Formal languages |
|
Machine theory |
| Other Form: |
Print version: Meduna, Alexander. Formal Languages and Computation : Models and Their Applications. Hoboken : CRC Press, ©2014 9781466513457 |
| ISBN |
9781466513495 (electronic bk.) |
|
1466513497 (electronic bk.) |
| Standard No. |
10.1201/b16376 doi |
|
More Resources