國立高雄大學圖資館 |

Automata theory and formal languagesfundamental notions, theorems, and techniques /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Automata theory and formal languagesby Alberto Pettorossi.
其他題名:	fundamental notions, theorems, and techniques /
作者:	Pettorossi, A.
出版者:	Cham :Springer International Publishing :2022.
面頁冊數:	viii, 280 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Human-computer interaction.
電子資源:	https://doi.org/10.1007/978-3-031-11965-1
ISBN:	9783031119651$q(electronic bk.)

Automata theory and formal languagesfundamental notions, theorems, and techniques /
Pettorossi, A.

Automata theory and formal languagesfundamental notions, theorems, and techniques /[electronic resource] :by Alberto Pettorossi. - Cham :Springer International Publishing :2022. - viii, 280 p. :ill., digital ;24 cm. - Undergraduate topics in computer science,2197-1781. - Undergraduate topics in computer science..

1 Formal Grammars and Languages -- 2 Finite Automata and Regular Grammars -- 3 Pushdown Automata and Context-Free Grammars -- 4 Linear Bounded Automata and Context-Sensitive Grammars -- 5 Turing Machines and Type 0 Grammars -- 6 Decidability and Undecidability in Context-Free Languages -- 7 Supplementary Topics.

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

ISBN: 9783031119651$q(electronic bk.)

Standard No.: 10.1007/978-3-031-11965-1doiSubjects--Topical Terms:

189333
Human-computer interaction.

LC Class. No.: QA76.9.H85 / P47 2022

Dewey Class. No.: 004.019

Automata theory and formal languagesfundamental notions, theorems, and techniques /
LDR:03479nmm a2200325 a 4500 001 628886
003 DE-He213
005 20220812112240.0
007 cr nn 008maaau
008 230224s2022 sz s 0 eng d
020 $a 9783031119651$q(electronic bk.)
020 $a 9783031119644$q(paper)
024 7 $a 10.1007/978-3-031-11965-1 $2 doi
035 $a 978-3-031-11965-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.H85 $b P47 2022
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.019 $2 23
090 $a QA76.9.H85 $b P511 2022
100 1 $a Pettorossi, A. $3 910687
245 1 0 $a Automata theory and formal languages $h [electronic resource] : $b fundamental notions, theorems, and techniques / $c by Alberto Pettorossi.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a viii, 280 p. : $b ill., digital ; $c 24 cm.
490 1 $a Undergraduate topics in computer science, $x 2197-1781
505 0 $a 1 Formal Grammars and Languages -- 2 Finite Automata and Regular Grammars -- 3 Pushdown Automata and Context-Free Grammars -- 4 Linear Bounded Automata and Context-Sensitive Grammars -- 5 Turing Machines and Type 0 Grammars -- 6 Decidability and Undecidability in Context-Free Languages -- 7 Supplementary Topics.
520 $a 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 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.
650 0 $a Human-computer interaction. $3 189333
650 0 $a Machine theory. $3 199330
650 0 $a Formal languages. $3 214985
650 1 4 $a Formal Languages and Automata Theory. $3 914922
650 2 4 $a Computer Science Logic and Foundations of Programming. $3 913141
650 2 4 $a Computability and Recursion Theory. $3 931679
650 2 4 $a Theory and Algorithms for Application Domains. $3 921479
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Undergraduate topics in computer science. $3 559648
856 4 0 $u https://doi.org/10.1007/978-3-031-11965-1
950 $a Computer Science (SpringerNature-11645)