Read more
This handbook introduces a variety of concepts in discrete mathematics and mathematical modeling for languages and computation. The authors pay special attention to the implementation of mathematical concepts to explain clearly how to encode them in computational practice. All computer programs are written in C#.
List of contents
- Part I: Basic mathematical concepts
- Chapter 1: Sets, sequences, and languages
- Chapter 2: Relations and functions
- Chapter 3: Graphs
- Part II: Classical models for languages and computation
- Chapter 4: Relations and language models
- Chapter 5: Finite automata
- Chapter 6: Context-free grammars
- Chapter 7: Pushdown automata
- Chapter 8: Turing machines
- Chapter 9: Computability
- Chapter 10: Decidability
- Part III: Alternative models for languages and computation
- Chapter 11: Context-dependent grammars
- Chapter 12: Regulated models
- Chapter 13: Parallel grammatical models
- Chapter 14: Jumping models
- Chapter 15: Deep pushdown automata
- Part IV: Applications
- Chapter 16: Applications in general
- Chapter 17: Applications in syntax analysis: programming languages
- Chapter 18: Applications in syntax analysis: natural languages
- Chapter 19: Applications in biology
- Part V: Conclusion
- Chapter 20: Concluding remarks
About the author
Alexander Meduna is Full Professor of Computer Science at the Brno University of Technology, Czech Republic. He has taught mathematics and computer science at various European, Asian, and American universities, including the University of Missouri, USA, where he spent a decade teaching advanced topics of the formal language theory and its applications in computer science. He is the author of several books and many papers on the topic.
