Deterministic Finite Automata (DFA), Non-deterministic Finite Automata (NFA), and conversion between them.
Mathematical theorems are broken down without skipping critical intermediate steps.
: Appendices provide 'C' source code for key algorithms, bridging the gap between theoretical models and practical programming.
Comprehensive treatment of Turing Machines and their variations.
: Covers finite state machines (DFA/NFA), regular expressions, and pushdown automata. Grammars & Parsing
If you are looking for , you can check the Biblio.com listing for paperback options.