Theory of Computer Science : Automata Language and Computation

By:

Mishra, K L P

Contributor(s):

Chandrasekaran, N

Material type: Text

TextPublication details: Delhi PHI 2007Edition: 3rdDescription: 422pISBN:

9788120329683

DDC classification:

004.01 MIS-T

Online resources:

Click here to access online

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	URL	Status	Barcode
Reference Book	Amity Central Library ASET CSE	Reference	004.01 MIS-T (Browse shelf(Opens below))	Link to resource	Not For Loan	25967
Books	Amity Central Library ASET CSE	Text Book	004.01 MIS-T (Browse shelf(Opens below))	Link to resource	Available	25968
Books	Amity Central Library ASET CSE	Text Book	004.01 MIS-T (Browse shelf(Opens below))	Link to resource	Available	25969
Books	Amity Central Library ASET CSE	Text Book	004.01 MIS-T (Browse shelf(Opens below))	Link to resource	Available	25970
Books	Amity Central Library ASET CSE	Text Book	004.01 MIS-T (Browse shelf(Opens below))	Link to resource	Available	25971
Books	Amity Central Library ASET CSE	Text Book	004.01 MIS-T (Browse shelf(Opens below))	Link to resource	Available	25972

Browsing Amity Central Library shelves, Shelving location: ASET CSE, Collection: Reference Close shelf browser (Hides shelf browser)

Previous						No cover image available	No cover image available	Next
Previous	004 WIL-U Using Information Techonology	004 YAD-F Foundation of Information Technology	004.01 MIS-T Theory of Computer Science : Automata languages and Computation	004.01 MIS-T Theory of Computer Science : Automata Language and Computation	004.019 HUM-H Human Computer Intiraction	004.03 BAN-N New Computer Dictionary	004.03 BAN-N New Computer Dictionary	Next

Preface. Notations. 1. Propositions and Predicates. 2. Mathematical Preliminaries. 3. The Theory of Automata. 4. Formal Languages. 5. Regular Sets and Regular Grammars. 6. Context-Free Languages. 7. Pushdown Automata. 8. LR(k) Grammars. 9. Turing Machines and Linear Bounded Automata. 10. Decidability and Recursively Enumerable Languages. 11. Computability. 12. Complexity. Answers to Self-Tests. Solutions (or Hints) to Chapter-end Exercises. Further Reading. Index.

There are no comments on this title.

to post a comment.