libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro
ARGOMENTO:  BOOKS > INFORMATICA > TESTI GENERALI

chowdhary k.r. - theory of computation
Zoom

Theory of Computation Automata, Formal Languages, Computation and Complexity




Disponibilità: Non ordinabile


PREZZO
162,98 €



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, Carta della Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Editore:

Springer

Pubblicazione: 03/2025





Trama

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.





Sommario

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





Autore

Professor K. R. Chowdhary currently teaches at JNV University, Jodhpur. He received his Bachelor's degree in Electronics & Communication Engineering with Honors division and later his Ph.D. from the same institution, in the area of Natural Language Processing.

His career has traversed diverse landscapes, encompassing pivotal roles in both research and education. His professional trajectory includes contributions in Research & Developments at Bhabha Atomic Research Centre in Mumbai, imparting knowledge and expertise as a faculty member at the IIT Jodhpur.

His research interests encompass a wide spectrum of topics, including automata theory, formal languages, complexity theory, distributed processing, artificial intelligence, machine learning, natural language, and speech processing.

 











Altre Informazioni

ISBN:

9789819762330

Condizione: Nuovo
Dimensioni: 235 x 155 mm
Formato: Copertina rigida
Illustration Notes:XXXVII, 644 p. 230 illus., 1 illus. in color.
Pagine Arabe: 644
Pagine Romane: xxxvii


Dicono di noi