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 Horáček 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.

• Part I: Basic mathematical conceptsChapter 1: Sets, sequences, and languagesChapter 2: Relations and functionsChapter 3: Graphs Part II: Classical models for languages and computationChapter 4: Relations and language modelsChapter 5: Finite automataChapter 6: Context-free grammarsChapter 7: Pushdown automataChapter 8: Turing machinesChapter 9: ComputabilityChapter 10: Decidability Part III: Alternative models for languages and computationChapter 11: Context-dependent grammarsChapter 12: Regulated modelsChapter 13: Parallel grammatical modelsChapter 14: Jumping modelsChapter 15: Deep pushdown automata Part IV: ApplicationsChapter 16: Applications in generalChapter 17: Applications in syntax analysis: programming languagesChapter 18: Applications in syntax analysis: natural languagesChapter 19: Applications in biology Part V: ConclusionChapter 20: Concluding remarks

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 Horáček 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.

• Part I: Basic mathematical conceptsChapter 1: Sets, sequences, and languagesChapter 2: Relations and functionsChapter 3: Graphs Part II: Classical models for languages and computationChapter 4: Relations and language modelsChapter 5: Finite automataChapter 6: Context-free grammarsChapter 7: Pushdown automataChapter 8: Turing machinesChapter 9: ComputabilityChapter 10: Decidability Part III: Alternative models for languages and computationChapter 11: Context-dependent grammarsChapter 12: Regulated modelsChapter 13: Parallel grammatical modelsChapter 14: Jumping modelsChapter 15: Deep pushdown automata Part IV: ApplicationsChapter 16: Applications in generalChapter 17: Applications in syntax analysis: programming languagesChapter 18: Applications in syntax analysis: natural languagesChapter 19: Applications in biology Part V: ConclusionChapter 20: Concluding remarks

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 Horáček 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.

• Part I: Basic mathematical conceptsChapter 1: Sets, sequences, and languagesChapter 2: Relations and functionsChapter 3: Graphs Part II: Classical models for languages and computationChapter 4: Relations and language modelsChapter 5: Finite automataChapter 6: Context-free grammarsChapter 7: Pushdown automataChapter 8: Turing machinesChapter 9: ComputabilityChapter 10: Decidability Part III: Alternative models for languages and computationChapter 11: Context-dependent grammarsChapter 12: Regulated modelsChapter 13: Parallel grammatical modelsChapter 14: Jumping modelsChapter 15: Deep pushdown automata Part IV: ApplicationsChapter 16: Applications in generalChapter 17: Applications in syntax analysis: programming languagesChapter 18: Applications in syntax analysis: natural languagesChapter 19: Applications in biology Part V: ConclusionChapter 20: Concluding remarks