Introduction to formal languages and automata Peter Linz.

By:

Linz, Peter

Material type: Text

TextPublication details: New delhi, Jones and Bartlett India pvt.ltd, 2018Edition: 6th edDescription: 449p, 23cmISBN:

9789384323219

Other title:

Introduction to formal languages & automata

Subject(s):

DDC classification:

519.736 LIN

Contents:

Introduction to the theory of computation -- Finite automata -- Regular languages and regular grammars -- Properties of regular languages -- Context-free languages -- Simplification of context-free grammars and Normal Forms-- Pushdown automata -- Properties of context-free languages -- Turing machines -- Other models of Turing machines -- A hierarchy of formal languages and automata -- Limits of algorithmic computation -- Other models of computation -- An overview to computational complexity.

Summary: Formal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language,

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

Average rating: 0.0 (0 votes)

Holdings ( 5 )
Title notes ( 2 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Status	Barcode
Books	IIITDM Kurnool General Stacks		519.736 LIN (Browse shelf(Opens below))	Available	0001512
Books	IIITDM Kurnool General Stacks		519.736 LIN (Browse shelf(Opens below))	Available	0001513
Books	IIITDM Kurnool General Stacks		519.736LIN (Browse shelf(Opens below))	Available	0001514
Books	IIITDM Kurnool General Stacks		519.736 LIN (Browse shelf(Opens below))	Available	0001515
Reference	IIITDM Kurnool Reference	Reference	519.736 LIN (Browse shelf(Opens below))	Not For Loan	0001516

Browsing IIITDM Kurnool shelves, Shelving location: Reference, Collection: Reference Close shelf browser (Hides shelf browser)

Previous								Next
Previous	519.55 KAN Nonlinear time series analysis /	519.713 HOP Introduction to automata theory, languages, and computation /	519.713 KAM Introduction to formal languages, automata theory and computation	519.736 LIN Introduction to formal languages and automata	519.854 ROS Discrete Mathematics and its applications with combinatorics and graph theory	520KAY 21st century astronomy	520KAY 21st century astronomy	Next

Introduction to the theory of computation --
Finite automata --
Regular languages and regular grammars --
Properties of regular languages --
Context-free languages --
Simplification of context-free grammars and Normal Forms--
Pushdown automata --
Properties of context-free languages --
Turing machines --
Other models of Turing machines --
A hierarchy of formal languages and automata --
Limits of algorithmic computation --
Other models of computation --
An overview to computational complexity.

Formal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language,

There are no comments on this title.

to post a comment.