02163nam a2200313 i 4500 CSPC 20260714102841.0 260714s2011 ii a 001 0 eng d 9789350141571 CSPC eng CSPC rda QA267 .P362011 005.131 P192t 23 Pandey, Adesh Kumar, author. Theory of automata and computation / Adesh Kumar Pandey. First edition. New Delhi, India : S.K. Kataria & Sons, 2011 ; Reprint 2022. 315 pages : illustrations ; 24 cm. rdacontent text rdamedia unmediated rdacarrier volume Includes index. Section-A: Finite automata -- Regular expression -- Introduction to machines -- Section-B: Properties of regular sets -- Context-free grammars and languages -- Simplified context-free grammar and its normal form -- Section-C: Pushdown automata -- Properties of context-free languages -- Turing machine -- Section-D: Chomsky heirarchies -- Computability and recursive function theory. "The book addresses a full spectrum of automata theory concepts used in computer science. Each of these concepts is presented in detail, since these concepts are basis of computer science and provide the basics for developing software techniques like designing and checking the behaviour of digital circuits, lexical-analyser of the typical compiler, and software for Natural Language Processing. To introduce the more formal aspects of Computer Science, the author has presented automata as foundation. For students who are ambitious to achieve unparalleled goals in the field of computer science, and want to develop their programming skills towards system programming, it becomes necessary that their mathematical concept are very clear"-- Preface of the book. Machine theory. Computational complexity. Recursion theory. ddc 0 BK P192t CIR 2011 23 005.131 0 0 ddc 0 0 CSPC CSPC CIR 2026-07-14 0 CIR 005.131 P192t 2011 031911 2026-07-14 09:50:10 1-1 2026-07-14 BK 32637 32637