03899nam a22002897a 4500003000400000005001700004008004100021020003100062040005900093100003600152245012600188260004000314300006900354336002100423337002400444338002400468500004500492505086100537520197801398521001103376541007503387546002103462650002203483650002103505650004703526650003603573OSt20260702150047.0260702s20242024sz a|||er|||| 001 0 eng d  a9783031439728 [hardrbound]  aUniversity of Cebu-BaniladcUniversity of Cebu-Banilad  aMorazán, Marco T., eauthor.   aProgramming-based formal languages and automata theory : bdesign, implement, validate, and prove / cMarco T. Morazán.  aSwitzerland : bSpringer, cc2024.   axxiii, 524 pages : billustrations (black and white) ; c24 cm.   2rdacontentatext  2rdamediaaunmedated  2rdacarrieravolume   ahttps://doi.org/10.1007/978-3-031-439735  aContents: Preface — 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 languages — 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 extension — 18 Context-sensitive grammars — 19 Church-turing thesis and undecidability — 20 Complexity — Part V Epilogue — 21 Where to Go from here.  a"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." --Backcover   aAdult   aPurchasedxOrtega, EricyCollege of Computer StudieszComputer Science  aText in English   aFormal languages.  aMachine theory.   aFunctional programming (Computer science).  aCompilers (Computer programs).