TY  - BOOK
AU  - Delfinado, Cecil Jose A., author. 
TI  - Automata theory / 
SN  - 9789719801733
AV  - F QA 267 D45 2014
PY  - 2014///
CY  - Quezon City : 
PB  - C & E Publishing, Inc., 
KW  - Machine theory.
KW  - Automata
N1  - Includes bibliographical references and index.; Contents 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
N2  - Automata 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
ER  -