Introduction to automata theory and formal languages / Adesh Kumar Pandey.
Material type:
TextPublication details: New Delhi : S.K. Kataria & Sons, 2015 ; Reprint 2017, 2022Edition: Sixth editionDescription: 358 pages : figures, tables ; 25 cmContent type: - text
- unmediated
- volume
- 9788188458479
- 511.35 P192i
| Item type | Current library | Shelving location | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
Books
|
Main Library | Circulation Section | CIR 511.35 P192i 2015 (Browse shelf(Opens below)) | 1-2 | Available | 022306 | ||
|
Books
|
Main Library | Circulation Section | CIR 511.35 P192i 2015 (Browse shelf(Opens below)) | 2-2 | Available | 028135 |
Browsing Main Library shelves, Shelving location: Circulation Section Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| CIR 511.35 L269 2018 Language computability and formal language theory | CIR 511.35 M363i 2011 Introduction to languages and the theory of computation | CIR 511.35 P192i 2015 Introduction to automata theory and formal languages / | CIR 511.35 P192i 2015 Introduction to automata theory and formal languages / | CIR 511.35 P192i 2018 An introduction to automata theory and formal languages | CIR 511.35 Si75i 2013 Introduction to the theory of computation / | CIR 511.352 T343 2018 Theory and practice of computation proceedings of workshop on computation: theory and practice WCTP2016/ |
Includes index.
Introduction to concept of automata -- Finite automata -- Automata with output -- Regular expression and languages -- Properties of regular languages -- Context-free grammars and languages -- Simplified context-free grammar and its normal form -- Pushdown automata -- Properties of context-free languages -- Turing machine -- Extension of turing machine -- Recursive function theory -- The chomsky hierarchy -- Tractable and intractable problems.
There are no comments on this title.