株式会社極東書店トップ商品一覧Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques. 1st ed. 2022

商品詳細

Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques. 1st ed. 2022

Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques. 1st ed. 2022

・ISBN 978-3-031-11964-4 paper EUR 54.99

¥14,698.- (税込) (※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。

お気に入り
著者・編者Pettorossi, Alberto,
シリーズ (Undergraduate Topics in Computer Science)
出版社 (Springer International Publishing AG, SZ)
出版年月2022
ページ数280 pp.
言語ENG
ニュース番号<A02-64802>

解説

Knowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general.

Presenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages. The book also examines decidable and undecidable problems with emphasis on the case for context-free languages.

Topics and features:

  • Provides theorems, examples, and exercises to clarify automata-languages correspondences
  • Presents some fundamental techniques for parsing both regular and context-free languages
  • Classifies subclasses of decidable problems, avoiding focus on the theory of complexity
  • Examines finite-automata minimalization and characterization of their behavior using regular expressions
  • Illustrates how to derive grammars of context-free languages in Chomsky and Greibach normal forms
  • Offers supplementary material on counter machines, stack automata, and abstract language families

This highly useful, varied text/reference is suitable for undergraduate and graduatecourses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic.

Alberto Pettorossi is professor of theoretical computer science at the University of Rome Tor Vergata, Rome, Italy.