國立虎尾科技大學 |

Automata Theory and Formal Languages = Fundamental Notions, Theorems, and Techniques /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Automata Theory and Formal Languages/ by Alberto Pettorossi.
其他題名:	Fundamental Notions, Theorems, and Techniques /
作者:	Pettorossi, Alberto.
面頁冊數:	VIII, 280 p. 91 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Theory and Algorithms for Application Domains. -
電子資源:	https://doi.org/10.1007/978-3-031-11965-1
ISBN:	9783031119651

Automata Theory and Formal Languages = Fundamental Notions, Theorems, and Techniques /
Pettorossi, Alberto.

Automata Theory and Formal LanguagesFundamental Notions, Theorems, and Techniques /[electronic resource] :by Alberto Pettorossi. - 1st ed. 2022. - VIII, 280 p. 91 illus.online resource. - 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

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

1388553
Theory and Algorithms for Application Domains.

LC Class. No.: QA267-268.5

Dewey Class. No.: 005.131

Automata Theory and Formal Languages = Fundamental Notions, Theorems, and Techniques /
LDR:03809nam a22003975i 4500 001 1089693
003 DE-He213
005 20220812112240.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031119651 $9 978-3-031-11965-1
024 7 $a 10.1007/978-3-031-11965-1 $2 doi
035 $a 978-3-031-11965-1
050 4 $a QA267-268.5
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
100 1 $a Pettorossi, Alberto. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1366212
245 1 0 $a Automata Theory and Formal Languages $h [electronic resource] : $b Fundamental Notions, Theorems, and Techniques / $c by Alberto Pettorossi.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a VIII, 280 p. 91 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 2 4 $a Theory and Algorithms for Application Domains. $3 1388553
650 2 4 $a Computability and Recursion Theory. $3 1396185
650 2 4 $a Computer Science Logic and Foundations of Programming. $3 1365757
650 1 4 $a Formal Languages and Automata Theory. $3 1365747
650 0 $a Recursion theory. $3 575916
650 0 $a Computable functions. $3 677058
650 0 $a Computer science. $3 573171
650 0 $a Machine theory. $3 527775
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031119644
776 0 8 $i Printed edition: $z 9783031119668
830 0 $a Undergraduate Topics in Computer Science, $x 1863-7310 $3 1254738
856 4 0 $u https://doi.org/10.1007/978-3-031-11965-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)