Normal view MARC view ISBD view

Introduction to computer theory / by Daniel I. A. Cohen

By: Cohen, Daniel I. A Material type: Text

TextPublication details: New Delhi : John Wiley, 2008cEdition: 2nd edDescription: xiv, 634 p. 24cmISBN: 9788126513345 (pbk)Subject(s): ComputadoresDDC classification: 004

Contents:

PART 1: Automata Theory-------- PART 2: Pushdown Automata Theory--------- PART 3: Turing Theory-----------------

Summary: Automata theory. Background. Languages. Recursive definitions. Regular expressions. Finite automata. Transition graphs. Kleene's theorem. Nondeterminism. Finite automata with output. Regular languages. Nonregular languages. Decidability. Pushdown automata Theory. Context-free grammars. Trees. Regular grammars. Chomsky normal form. Pushdown automata. CFG=PDA. Context-free languages. Non-context-free languages.

List(s) this item appears in: CS titles

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

Average rating: 0.0 (0 votes)

Holdings ( 8 )
Title notes ( 3 )
Comments ( 0 )

Holdings
Item type	Current library	Call number	Copy number	Status	Barcode
Books	Namal Library Computer Science	004 COH-I 2008 1334 (Browse shelf (Opens below))	1	Available	1334
Books	Namal Library Computer Science	004 COH-I 2008 2625 (Browse shelf (Opens below))	2	Available	0002625
Books	Namal Library Computer Science	004 COH-I 2008 2626 (Browse shelf (Opens below))	3	Available	0002626
Reference	Namal Library Reference	004 COH-I 2008 2627 (Browse shelf (Opens below))	4	Not for loan	0002627
Books	Namal Library Computer Science	004 COH-I 2008 2628 (Browse shelf (Opens below))	5	Available	0002628
Books	Namal Library Computer Science	004 COH-I 2008 2629 (Browse shelf (Opens below))	6	Available	0002629
Books	Namal Library Computer Science	004 COH-I 2008 2630 (Browse shelf (Opens below))	7	Available	0002630
Books	Namal Library Computer Science	004 COH-I 2008 2631 (Browse shelf (Opens below))	8	Available	0002631

Total holds: 0

Index included

PART 1: Automata Theory--------
PART 2: Pushdown Automata Theory---------
PART 3: Turing Theory-----------------

Automata theory. Background. Languages. Recursive definitions. Regular expressions. Finite automata. Transition graphs. Kleene's theorem. Nondeterminism. Finite automata with output. Regular languages. Nonregular languages. Decidability. Pushdown automata Theory. Context-free grammars. Trees. Regular grammars. Chomsky normal form. Pushdown automata. CFG=PDA. Context-free languages. Non-context-free languages.

There are no comments on this title.

to post a comment.