Handbook of Mathematical Models for Languages and Computation
21%
off

Handbook of Mathematical Models for Languages and Computation

By (author)  , By (author)  , By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 4 business days


When will my order arrive?

Available. Expected delivery to the United States in 9-12 business days.


Not ordering to the United States? Click here.

Description

The theory of computation is used to address challenges arising in many computer science areas such as artificial intelligence, language processors, compiler writing, information and coding systems, programming language design, computer architecture and more. To grasp topics concerning this theory readers need to familiarize themselves with its computational and language models, based on concepts of discrete mathematics including sets, relations, functions, graphs and logic.


This handbook introduces with rigor the important concepts of this kind and uses them to cover the most important mathematical models for languages and computation, such as various classical as well as modern automata and grammars. It explains their use in such crucially significant topics of computation theory as computability, decidability, and computational complexity. The authors pay special attention to the implementation of all these mathematical concepts and models and explains clearly how to encode them in computational practice. All computer programs are written in C#.
show more

Product details

  • Hardback | 760 pages
  • 156 x 234 x 43.18mm | 1,224.7g
  • Stevenage, United Kingdom
  • English
  • 1785616595
  • 9781785616594

Table 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
show more

About Alexander Meduna

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.


Petr Horacek works as a software engineer in research and development for BioVendor Instruments a.s. (a laboratory for automation and diagnostic devices) in Brno, Czech Republic. Under the supervision of Alexander Meduna, he received his PhD from the Brno University of Technology, Czech Republic, in 2015.


Martin Tomko is a PhD Student supervised by Alexander Meduna at the Faculty of Information Technology, Brno University of Technology, Czech Republic.
show more