東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Programming-based formal languages and automata theory = design, implement, validate, and prove /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Programming-based formal languages and automata theory/ by Marco T. Morazán.
其他題名:	design, implement, validate, and prove /
作者:	Morazán, Marco T.
出版者:	Cham :Springer Nature Switzerland : : 2024.,
面頁冊數:	xxiii, 524 p. :ill. (some col.), digital ;24 cm.
內容註:	Part I: Fundamental Concepts -- 1. Introduction to FSM -- 2. Essential Background -- 3. Types of Proofs -- Part II: Regular Languages -- 4. Regular Expressions -- 5. Deterministic Finite-State Machines -- 6. Nondeterministic Finite State Machines -- 7. Finite-State Automatons and Regular Expressions -- 8. Regular Grammars -- 9. Languages that are not Regular -- Part III: Context-Free Languages -- 10. Context-Free Grammars -- 11. Pushdown Automata -- 12. Equivalence of pdas and cfgs -- 13. Properties of Context-Free Languages -- 14. Deterministic PDAs -- Part IV: Context-Sensitive Languages -- 15. Turing Machines -- 16. Turing Machine Composition -- 17. Turing Machine Extensions -- 18. Context-Sensitive Grammars -- 19. Church-Turing Thesis and Undecidability -- 20. Complexity -- Part V: Epilogue -- 21. Where to Go From Here.
Contained By:	Springer Nature eBook
標題:	Formal languages. -
電子資源:	https://doi.org/10.1007/978-3-031-43973-5
ISBN:	9783031439735

Programming-based formal languages and automata theory = design, implement, validate, and prove /
Morazán, Marco T.

Programming-based formal languages and automata theorydesign, implement, validate, and prove /[electronic resource] :by Marco T. Morazán. - Cham :Springer Nature Switzerland :2024. - xxiii, 524 p. :ill. (some col.), digital ;24 cm. - Texts in computer science,1868-095X. - Texts in computer science..

Part I: Fundamental Concepts -- 1. Introduction to FSM -- 2. Essential Background -- 3. Types of Proofs -- Part II: Regular Languages -- 4. Regular Expressions -- 5. Deterministic Finite-State Machines -- 6. Nondeterministic Finite State Machines -- 7. Finite-State Automatons and Regular Expressions -- 8. Regular Grammars -- 9. Languages that are not Regular -- Part III: Context-Free Languages -- 10. Context-Free Grammars -- 11. Pushdown Automata -- 12. Equivalence of pdas and cfgs -- 13. Properties of Context-Free Languages -- 14. Deterministic PDAs -- Part IV: Context-Sensitive Languages -- 15. Turing Machines -- 16. Turing Machine Composition -- 17. Turing Machine Extensions -- 18. Context-Sensitive Grammars -- 19. Church-Turing Thesis and Undecidability -- 20. Complexity -- Part V: Epilogue -- 21. Where to Go From Here.

This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical.

ISBN: 9783031439735

Standard No.: 10.1007/978-3-031-43973-5doiSubjects--Topical Terms:

579700
Formal languages.

LC Class. No.: QA267.3

Dewey Class. No.: 511.3

Programming-based formal languages and automata theory = design, implement, validate, and prove /
LDR:03853nmm a2200337 a 4500 001 2367596
003 DE-He213
005 20231218075039.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031439735 $q (electronic bk.)
020 $a 9783031439728 $q (paper)
024 7 $a 10.1007/978-3-031-43973-5 $2 doi
035 $a 978-3-031-43973-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.3
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 511.3 $2 23
090 $a QA267.3 $b .M832 2024
100 1 $a Morazán, Marco T. $3 3710824
245 1 0 $a Programming-based formal languages and automata theory $h [electronic resource] : $b design, implement, validate, and prove / $c by Marco T. Morazán.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a xxiii, 524 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Texts in computer science, $x 1868-095X
505 0 $a Part I: Fundamental Concepts -- 1. Introduction to FSM -- 2. Essential Background -- 3. Types of Proofs -- Part II: Regular Languages -- 4. Regular Expressions -- 5. Deterministic Finite-State Machines -- 6. Nondeterministic Finite State Machines -- 7. Finite-State Automatons and Regular Expressions -- 8. Regular Grammars -- 9. Languages that are not Regular -- Part III: Context-Free Languages -- 10. Context-Free Grammars -- 11. Pushdown Automata -- 12. Equivalence of pdas and cfgs -- 13. Properties of Context-Free Languages -- 14. Deterministic PDAs -- Part IV: Context-Sensitive Languages -- 15. Turing Machines -- 16. Turing Machine Composition -- 17. Turing Machine Extensions -- 18. Context-Sensitive Grammars -- 19. Church-Turing Thesis and Undecidability -- 20. Complexity -- Part V: Epilogue -- 21. Where to Go From Here.
520 $a This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical.
650 0 $a Formal languages. $3 579700
650 0 $a Machine theory. $3 523249
650 1 4 $a Formal Languages and Automata Theory. $3 3592087
650 2 4 $a Software Engineering. $3 890874
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Texts in computer science. $3 1567573
856 4 0 $u https://doi.org/10.1007/978-3-031-43973-5
950 $a Computer Science (SpringerNature-11645)