What do you think?
Rate this book
Quick Concepts in Computer Science: Regular Languages
Understanding the theoretical underpinnings of computer science is key to designing and implementing efficient algorithms. In this volume we cover the regular languages and the various ways of representing and recognizing them, including finite automata, regular expressions, and regular grammars.
The author holds an earned PhD from Colorado State University, where he taught Foundations of Computer Science for six semesters. This textbook presents regular languages in such a way as to address common difficulties students have with the material, and is designed to be used either for self-study or (along with the remaining volumes in the series) as the textbook for a class on theoretical computer science.
The author holds an earned PhD from Colorado State University, where he taught Foundations of Computer Science for six semesters. This textbook presents regular languages in such a way as to address common difficulties students have with the material, and is designed to be used either for self-study or (along with the remaining volumes in the series) as the textbook for a class on theoretical computer science.
56 pages, Kindle Edition
First published May 16, 2015
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.