Picture 1 of 1
Picture 1 of 1
Texts in Computer Science Ser.: Programming-Based Formal Languages and Automata Theory : Design, Implement, Validate, and Prove by Marco T. Morazán (2023, Hardcover)
Brothers Bookstore (5029)
99.4% positive feedback
Price:
US $31.89
ApproximatelyRM 134.15
+ $24.40 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherSpringer
ISBN-103031439724
ISBN-139783031439728
eBay Product ID (ePID)24062262229
Product Key Features
Number of PagesXxiii, 524 Pages
LanguageEnglish
Publication NameProgramming-Based Formal Languages and Automata Theory : Design, Implement, Validate, and Prove
SubjectSoftware Development & Engineering / General, Computer Science, General
Publication Year2023
TypeTextbook
AuthorMarco T. Morazán
Subject AreaMathematics, Computers
SeriesTexts in Computer Science Ser.
FormatHardcover
Dimensions
Item Weight34.6 Oz
Item Length9.3 in
Item Width6.1 in
Additional Product Features
Dewey Edition23
Number of Volumes1 vol.
IllustratedYes
Dewey Decimal005.131
Table Of ContentPart 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.
SynopsisThis 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.
LC Classification NumberQA267-268.5
Be the first to write a review
