000			04062nam a22003377a 4500
003			OSt
005			20260702150047.0
008			260702s20242024sz a|||er|||| 001 0 eng d
020			_a9783031439728 [hardrbound]
040			_aUniversity of Cebu-Banilad _cUniversity of Cebu-Banilad
100			_aMorazán, Marco T., _eauthor.
245			_aProgramming-based formal languages and automata theory : _bdesign, implement, validate, and prove / _cMarco T. Morazán.
260			_aSwitzerland : _bSpringer, _cc2024.
300			_axxiii, 524 pages : _billustrations (black and white) ; _c24 cm.
336			_2rdacontent _atext
337			_2rdamedia _aunmedated
338			_2rdacarrier _avolume
500			_ahttps://doi.org/10.1007/978-3-031-439735
505			_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.
520			_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
521			_aAdult
541			_aPurchased _xOrtega, Eric _yCollege of Computer Studies _zComputer Science
546			_aText in English
650			_aFormal languages.
650			_aMachine theory.
650			_aFunctional programming (Computer science).
650			_aCompilers (Computer programs).
942			_2ddc _cBK
998			_cJanna [new] _d07/02/2026
999			_c15448 _d15448