Automata Theory and Formal Languages
- Length: 232 pages
- Edition: 1
- Language: English
- Publisher: de Gruyter
- Publication Date: 2022-01-31
- ISBN-10: 3110752271
- ISBN-13: 9783110752274
- Sales Rank: #0 (See Top 100 Books)
The book is a concise, self-contained and fully updated introduction to automata theory – a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students.
Title Page Copyright Contents Foreword Preface 1 Preliminaries 1.1 Sets Example 1.1. Example 1.2. 1.2 Relations 1.2.1 Multiplace relations 1.2.2 Two place relations 1.2.3 Binary relations 1.2.4 Equivalence relations 1.2.5 Closure of relations 1.3 Mathematical induction Definition 1.6. Definition 1.7. 1.4 Graphs and trees 1.4.1 Graphs 1.4.2 Trees 1.5 Languages 1.5.1 Basic definitions 1.5.2 Operations on languages 1.6 Grammars Definition 1.15. Definition 1.16. Definition 1.17. Example 1.12. Definition 1.18. Example 1.13. 1.7 Problems Problem 1.1. Solution. Problem 1.2. Solution. Problem 1.3. Solution. Problem 1.4. Solution. Problem 1.5. Solution. Part I Grammars and generating languages 2 Regular expressions and regular languages 2.1 Regular expressions and regular languages 2.2 Problems 3 Context-free grammars 3.1 Context-free grammars – basics 3.2 Simplification of context-free grammars 3.3 Normal forms of context-free grammars 3.4 Pumping and Ogden lemmas 3.5 Context-free language membership 3.6 Applications 3.7 Problems 4 Context-sensitive grammars and unrestricted grammars 4.1 Context-sensitive grammars 4.2 Unrestricted grammars Part II Automata and accepting languages 5 Turing machines 5.1 Deterministic Turing machines 5.2 Nondeterministic Turing machines 5.3 Linear bounded automata 5.4 Problems 6 Pushdown automata 6.1 Nondeterministic pushdown automata 6.2 Deterministic pushdown automata 6.3 Accepting states versus empty stack 6.4 Pushdown automata as Turing machines 6.5 Problems 7 Finite automata 7.1 Deterministic finite automata 7.2 Nondeterministic finite automata 7.3 Finite automata with ε-transitions 7.4 Finite automata as Turing machines 7.5 Problems Part III Revisited: languages, grammars, automata 8 Grammars versus automata 8.1 Regular expressions, regular grammars and finite automata 8.2 More grammars and automata 9 Around the hierarchy of languages 9.1 More operations on languages 9.2 Closure 9.3 The hierarchy of languages Bibliography References Additional readings, not cited in the text Subject Index Notes
Donate to keep this site alive
To access the Link, solve the captcha.
1. Disable the AdBlock plugin. Otherwise, you may not get any links.
2. Solve the CAPTCHA.
3. Click download link.
4. Lead to download server to download.