000			01867nam a22002537a 4500
003			OSt
005			20231025013310.0
008			210324b ||||| |||| 00| 0 eng d
020			_a9789719801733
040			_aCvSU-CCAT Campus Library. _bEnglish _cCvSU-CCAT Campus Library. _erda.
050			_aF QA 267 _bD45 2014
100			_aDelfinado, Cecil Jose A., author. _92746
245			_aAutomata theory / _cCecil Jose A. Delfinado.
260			_aQuezon City : _bC & E Publishing, Inc., _cc2014.
300			_axii, 342 pages : _billustrations ; _c22 cm
504			_aIncludes bibliographical references and index.
505			_aContents v -- Preface ix -- Foundations 1 -- Finite Automata 19 -- Regular Expressions 49 -- Pumping Lemma for Regular Languages 69 -- Special Finite Automata 81 -- Properties of Regular Languages 107 -- Context-Free Grammars 127 -- CFG Normal Forms 155 -- Pushdown Automata 173 -- Pumping Lemma for CFLs 203 -- Properties of Context-Free Languages 219 -- Turing Machines 243 -- TM Variants 265 -- Chomsky Hierarchy 287 -- Computability Theory 309 -- Bibliography 333 -- Index 336
520			_aAutomata theory is concerned with the study of computational models. These are abstract machines and grammatical tools that can compute functions, enumerate items, decide problems or recognize elements with specific properties. Automata theory studies the computational power and limitations of these machines. These models are associated with physical hardware like computers and the software that runs them. It has many applications in fields like natural language processing, compiler design, software engineering and information systems.
546			_aIn English text.
650			_aMachine theory. _92747
650			_aAutomata. _97873
942			_cBK _hQA 267 D45 2014 _kF _2lcc
999			_c942 _d942