Formal Languages & Automata Theory

By:

Anami, Basavaraj S

By:

K G, Karibasappa

Material type: Text

TextLanguage: English Publication details: New Delhi : Wiley India Pvt.Ltd, 2011Description: 236ISBN:

9788126520107

Subject(s):

DDC classification:

511.35 ANA

Summary: Formal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages in finite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in construction of compilers and designing of programming languages, thus establishing the course as a core paper in third/fourth year of various universities. This book adopts a holistic approach to learning from fundamentals of formal languages to undecidability problems. Its organization follows the order in which the course is taught over the years, and is well-accepted by the student community. The contents of each topic motivate the reader to easily understand the concepts rather than remember and reproduce.

List(s) this item appears in: New Arrivals for the Month of March 2023 - Applied Mathematics

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	Call number	Status	Date due	Barcode	Item holds
Book	Alliance School of Liberal Arts	511.35 ANA (Browse shelf(Opens below))	Checked out	24/12/2024	LA01366

Total holds: 0

Browsing Alliance School of Liberal Arts shelves Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.1 SAR Textbook of Discrete Mathematics	511.1 VEE Discrete Mathematics: With Graph Theory and Combinatorics	511.1 VEE Discrete Mathematics: With Graph Theory and Combinatorics	511.35 ANA Formal Languages & Automata Theory	511.5 WES Introduction to Graph Theory	511.6 KRI Combinatorics: Theory and Applications	511.6 WES Combinatorial Mathematics	Next

Formal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages in finite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in construction of compilers and designing of programming languages, thus establishing the course as a core paper in third/fourth year of various universities. This book adopts a holistic approach to learning from fundamentals of formal languages to undecidability problems. Its organization follows the order in which the course is taught over the years, and is well-accepted by the student community. The contents of each topic motivate the reader to easily understand the concepts rather than remember and reproduce.

There are no comments on this title.

to post a comment.