Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques

Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques (Undergraduate Topics in Computer Science)
Author: Alberto Pettorossi
Publisher Finelybook 出版社:Springer; 1st ed. 2022 edition (August 13, 2022)
Language 语言:English
pages 页数:288 pages
ISBN-10 书号:3031119649
ISBN-13 书号:9783031119644

Book Description
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 Author: the fact that the recognition and the manipulation of sentences in a given class of languages can be done Author: 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 graduate courses 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.

下载地址 Download隐藏内容需1积分,VIP免费,请先 !没有帐号? 注 册 一个!
未经允许不得转载:finelybook » Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques

评论 抢沙发

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址