000 04203nam a22003855i 4500
001 397796
003 ES-MaUEC
005 20240104162616.0
006 a||||fo|||| 00| 0
007 cr nn 008mamaa
008 231218s2024 sz | s |||| 0|eng d
020 _a9783031439735
024 7 _a10.1007/978-3-031-43973-5
_2doi
040 _aES-MaUEC
_bspa
_cES-MaUEC
050 0 4 _aQA267-268.5
_b2024
100 1 _aMorazán, Marco T.
_eautor
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 0 0 _aProgramming-Based Formal Languages and Automata Theory
_b: Design, Implement, Validate, and Prove
_cby Marco T Morazán
250 _afirst edition 2024
264 1 _aCham
_c2024
_bSpringer International Publishing
300 _a1 recurso en línea
336 _atexto
_btxt
_2rdacontent
337 _aelectrónico
_bc
_2rdamedia
338 _arecurso electrónico
_bcr
_2rdacarrier
347 _atext file
_bPDF
490 0 _aTexts in Computer Science
_x1868-095X
505 0 _aPart 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 _aThis 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.
856 4 0 _uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-43973-5
_zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _2lcc
_cLE
988 _aSpringer_Computer_2024
999 _c397796
_d397796