Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove: Texts in Computer Science
Autor Marco T. Morazánen Limba Engleză Hardback – 19 dec 2023
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.
Din seria Texts in Computer Science
- 20% Preț: 474.58 lei
- 20% Preț: 675.35 lei
- 20% Preț: 409.70 lei
- 20% Preț: 306.35 lei
- 20% Preț: 379.63 lei
- 20% Preț: 1244.39 lei
- 20% Preț: 406.21 lei
- 20% Preț: 366.93 lei
- 20% Preț: 305.30 lei
- 20% Preț: 444.93 lei
- 20% Preț: 411.75 lei
- 20% Preț: 441.70 lei
- 20% Preț: 370.59 lei
- 20% Preț: 503.87 lei
- 20% Preț: 370.22 lei
- 20% Preț: 515.34 lei
- 15% Preț: 637.58 lei
- 20% Preț: 353.33 lei
- 20% Preț: 356.82 lei
- 20% Preț: 181.92 lei
- 20% Preț: 330.42 lei
- 20% Preț: 394.57 lei
- 20% Preț: 743.62 lei
- 20% Preț: 663.45 lei
- Preț: 457.75 lei
- 20% Preț: 536.66 lei
- 20% Preț: 358.24 lei
- Preț: 385.84 lei
- 20% Preț: 344.76 lei
- 20% Preț: 621.18 lei
- 20% Preț: 350.86 lei
- 20% Preț: 348.89 lei
- 20% Preț: 339.95 lei
- 20% Preț: 588.21 lei
- 20% Preț: 199.57 lei
- 20% Preț: 341.30 lei
- 23% Preț: 726.93 lei
- 20% Preț: 325.30 lei
- 20% Preț: 595.80 lei
- 20% Preț: 593.48 lei
- Preț: 454.30 lei
- 20% Preț: 524.11 lei
Preț: 408.28 lei
Preț vechi: 510.35 lei
-20% Nou
Puncte Express: 612
Preț estimativ în valută:
78.16€ • 80.43$ • 65.88£
78.16€ • 80.43$ • 65.88£
Carte tipărită la comandă
Livrare economică 01-15 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031439728
ISBN-10: 3031439724
Pagini: 524
Ilustrații: XXIII, 524 p. 163 illus., 38 illus. in color.
Dimensiuni: 155 x 235 x 116 mm
Greutate: 0.94 kg
Ediția:1st ed. 2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Texts in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031439724
Pagini: 524
Ilustrații: XXIII, 524 p. 163 illus., 38 illus. in color.
Dimensiuni: 155 x 235 x 116 mm
Greutate: 0.94 kg
Ediția:1st ed. 2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Texts in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
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.
Notă biografică
Marco T. Morazán is a Full Professor in the Department of Mathematics and Computer Science at Seton Hall University. His main research areas are the implementation of programming languages and computer science education. He developed the FSM (Functional State Machines) programming language, has pioneered an effective computer science curriculum for beginners based on the development of video games, and has turned the automata theory classroom to programming-based activities. Currently he chairs the Steering Committee of the annual Trends in Functional Programming Symposium (TFP), is a Steering Committee Member of the annual Implementation and Application of Functional Languages Symposium (IFL), and is a co-founder of the annual Trends in Functional Programming in Education Workshop.
Textul de pe ultima copertă
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.
Caracteristici
Covers all the mathematical development traditionally employed in computational theory courses Reviews essential mathematical background on sets, relations, formal logic, and reasoning about infinite sets Provides students with the FSM programming language to implement their machines, grammars, and regular expressions