This chapter makes several general remarks about computational applications of modern language models covered earlier in this book. It also discusses their application perspectives in computer science in the near future. As we know by now, however, all these models represent an enormously large variety of grammars and automata. Therefore, we narrow our attention only to some of them. Specifically, we choose regulated grammars (see Chapter 12), scattered context grammars (see Section 13.1), grammar systems (see Section 13.3), and regulated pushdown automata (see Chapter 12) for this purpose. Regarding the computer-science-application areas, we focus our principle attention on two areas-computational linguistics and computational biology.

Chapter Contents:

• 16.1 Applications in computational linguistics: general comments
• 16.2 Applications in computational biology: general comments

Inspec keywords: formal languages

Other keywords: grammars; automata; language models; computer science

Subjects: Formal languages and computational linguistics