Programming-Based Formal Languages and Automata Theory
Autor Marco T. Morazánen Limba Engleză Paperback – 20 dec 2024
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 419.44 lei 38-44 zile | |
| Springer – 20 dec 2024 | 419.44 lei 38-44 zile | |
| Hardback (1) | 392.66 lei 6-8 săpt. | |
| Springer Nature Switzerland – 19 dec 2023 | 392.66 lei 6-8 săpt. |
Preț: 419.44 lei
Preț vechi: 524.30 lei
-20%
Puncte Express: 629
Preț estimativ în valută:
74.19€ • 86.72$ • 64.50£
74.19€ • 86.72$ • 64.50£
Carte tipărită la comandă
Livrare economică 03-09 martie
Specificații
ISBN-13: 9783031439759
ISBN-10: 3031439759
Pagini: 548
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.82 kg
Editura: Springer
ISBN-10: 3031439759
Pagini: 548
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.82 kg
Editura: Springer
V-ar putea interesa
-
-20%Preț: 200.04 lei250.06 lei -
Automata TheoryJavier Esparza-23%Preț: 511.80 lei660.96 lei -
The Little ProverCarl Eastlund-20%Preț: 265.67 lei332.09 lei -
Principles of Concurrent and Distributed ProgrammingMordechai Ben-Ari-13%Preț: 597.12 lei686.35 lei -
Programming Language PragmaticsMichael Scott-41%Preț: 453.95 lei769.01 lei -
Programming Challenges: The Programming Contest Training ManualSteven S Skiena-20%Preț: 427.37 lei534.21 lei -
Computer Architecture: A Quantitative ApproachJohn L. Hennessy-20%Preț: 705.36 lei881.71 lei -
Sipser, M: Introduction to the Theory of ComputationMichael (Massachusetts Institute of Technology) Sipser-25%Preț: 573.28 lei766.23 lei -
-44%Preț: 544.54 lei970.31 lei -
CompilersAlfred V. Aho-20%Preț: 614.07 lei767.59 lei -
C++ How to Program, Global EditionPaul Deitel-20%Preț: 506.58 lei633.22 lei -
Coding for Dummies, All New EditionPaul McFedries-20%Preț: 131.50 lei164.38 lei -
Click, Connect, Compute: Computer Science EssentialsDr Dharini Balasubramaniam-38%Preț: 48.34 lei78.19 lei -
Strange Code: Esoteric Languages That Make Programming Fun AgainRonald T. Kneusel-36%Preț: 241.16 lei377.98 lei -
-36%Preț: 273.13 lei426.64 lei -
Math for ProgrammingRonald T. Kneusel-36%Preț: 227.45 lei355.77 lei -
-37%Preț: 219.86 lei349.76 lei -
-20%Preț: 322.61 lei403.26 lei -
-20%Preț: 704.38 lei880.47 lei
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