Automata, Formal Languages, and Turing Machines

by Emre Sermutlu

Turing Machines serve as valuable tools for comprehending the theoretical foundations of computer science, providing a panoramic view of all conceivable algorithms. Although this approach is highly enlightening, its abstract nature can pose challenges.I have been teaching intricate mathematical concepts to college students for several decades, and my philosophy boils down to two Motivation and gradualism.You must see where the path leads before getting lost in the theorem jungle. Also, each exercise must take you one step higher. Soon enough, you will find yourself at the peak, where the view of the algorithmic landscape is breathtaking!

Genres: Computer Science

348 pages, Kindle Edition

Published September 25, 2020

Reviews

[Michiel · Rating 5 out of 5]

Automata are mathematical abstractions of computation and practically very relevant for text parsing. This delightful book gently introduces this abstract topic from finite state automata to NP complete problems. Every chapter had ample examples and exercises with solutions, making it ideal for self study.

[Stephen Muiruri · Rating 5 out of 5]

Nice read

Very interesting content and an approach that further simplifies the concepts. I highly recommend the book to programmers and problem solvers alike.