Programming-Based Formal Languages and Automata Theory

Design, Implement, Validate, and Prove

AvMarco T. Morazán

Häftad, Engelska, 2024

Del i serien Texts in Computer Science

665 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

665 kr

Beskrivning

This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. Part II starts the study of formal languages and automata theory in earnest with regular languages. Part III starts the exploration of languages that are not regular with context-free languages.

Produktinformation

Utgivningsdatum:2024-12-20
Mått:155 x 235 x 30 mm
Vikt:820 g
Format:Häftad
Språk:Engelska
Serie:Texts in Computer Science
Antal sidor:524
Förlag:Springer International Publishing AG
ISBN:9783031439759

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT

Mer om författaren

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.

Innehållsförteckning

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.