Handbook of Mathematical Models for Languages and Computation (Computing and Networks)

個数：

Handbook of Mathematical Models for Languages and Computation (Computing and Networks)

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    【重要ご説明事項】
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版／ページ数 760 p.
  • 言語 ENG
  • 商品コード 9781785616594
  • DDC分類 004

Full 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#.

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

最近チェックした商品

Touch Me
  • 洋書
Touch Me