國立高雄大學圖資館 |

Language: English

Back

Theory of computationautomata, formal languages, computation and complexity /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Theory of computationby K.R. Chowdhary.
Reminder of title:	automata, formal languages, computation and complexity /
Author:	Chowdhary, K. R.
Published:	Singapore :Springer Nature Singapore :2025.
Description:	xxxvii, 644 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Machine theory.
Online resource:	https://doi.org/10.1007/978-981-97-6234-7
ISBN:	9789819762347$q(electronic bk.)

Theory of computationautomata, formal languages, computation and complexity /
Chowdhary, K. R.

Theory of computationautomata, formal languages, computation and complexity /[electronic resource] :by K.R. Chowdhary. - Singapore :Springer Nature Singapore :2025. - xxxvii, 644 p. :ill. (some col.), digital ;24 cm.

Mathematical Preliminaries -- Finite Automata and Regular Expressions -- Variants of Finite Automata -- Minimization of Finite Automata -- Regular Languages.

This book offers a fresh perspective on the study and teaching of the Theory of Computation. The author's selection of topics and the comprehensive set of questions demonstrate extensive knowledge and years of experience in both teaching and research. It addresses practical aspects of computing models that are often overlooked. The book's emphasis on pedagogy, through carefully crafted exercises and clear elucidation of learning outcomes and chapter summaries, is a refreshing approach to the subject. With the right platform, this book has the potential to be adopted as a textbook in universities worldwide. The book covers new developments not typically addressed in other texts on the subject, such as algebraic theory, new applications of finite automata and regular languages, and topics from compiler theory that are closely related. It also explores several new relationships among models, with a natural progression of chapters. Key strengths of this book include its coverage of contemporary and relevant topics, practical applications of theoretical concepts, an extended Chomsky Hierarchy, and discussions on decidability, undecidability, and unsolvability. The book is tailored for its intended audience, with selected chapters suitable for undergraduate B.Tech./B.E. computer science students. Additionally, Chapters 9-14 can be used for a course on "Advanced Topics in Theory of Computer Science" at the Master's level (M.E./M.Tech.). It also serves as a foundational resource for those engaged in research in computer science.

ISBN: 9789819762347$q(electronic bk.)

Standard No.: 10.1007/978-981-97-6234-7doiSubjects--Topical Terms:

199330
Machine theory.

LC Class. No.: QA267

Dewey Class. No.: 511.3

Theory of computationautomata, formal languages, computation and complexity /
LDR:02704nmm a2200325 a 4500 001 679609
003 DE-He213
005 20250320115245.0
006 m d
007 cr nn 008maaau
008 251110s2025 si s 0 eng d
020 $a 9789819762347$q(electronic bk.)
020 $a 9789819762330$q(paper)
024 7 $a 10.1007/978-981-97-6234-7 $2 doi
035 $a 978-981-97-6234-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UY $2 bicssc
072 7 $a COM000000 $2 bisacsh
072 7 $a UY $2 thema
082 0 4 $a 511.3 $2 23
090 $a QA267 $b .C552 2025
100 1 $a Chowdhary, K. R. $3 859500
245 1 0 $a Theory of computation $h [electronic resource] : $b automata, formal languages, computation and complexity / $c by K.R. Chowdhary.
260 $a Singapore : $b Springer Nature Singapore : $b Imprint: Springer, $c 2025.
300 $a xxxvii, 644 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a Mathematical Preliminaries -- Finite Automata and Regular Expressions -- Variants of Finite Automata -- Minimization of Finite Automata -- Regular Languages.
520 $a This book offers a fresh perspective on the study and teaching of the Theory of Computation. The author's selection of topics and the comprehensive set of questions demonstrate extensive knowledge and years of experience in both teaching and research. It addresses practical aspects of computing models that are often overlooked. The book's emphasis on pedagogy, through carefully crafted exercises and clear elucidation of learning outcomes and chapter summaries, is a refreshing approach to the subject. With the right platform, this book has the potential to be adopted as a textbook in universities worldwide. The book covers new developments not typically addressed in other texts on the subject, such as algebraic theory, new applications of finite automata and regular languages, and topics from compiler theory that are closely related. It also explores several new relationships among models, with a natural progression of chapters. Key strengths of this book include its coverage of contemporary and relevant topics, practical applications of theoretical concepts, an extended Chomsky Hierarchy, and discussions on decidability, undecidability, and unsolvability. The book is tailored for its intended audience, with selected chapters suitable for undergraduate B.Tech./B.E. computer science students. Additionally, Chapters 9-14 can be used for a course on "Advanced Topics in Theory of Computer Science" at the Master's level (M.E./M.Tech.). It also serves as a foundational resource for those engaged in research in computer science.
650 0 $a Machine theory. $3 199330
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Theory of Computation. $3 274475
650 2 4 $a Computer Science Logic and Foundations of Programming. $3 913141
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-981-97-6234-7
950 $a Computer Science (SpringerNature-11645)