January 2016
Beginner to intermediate
450 pages
10h 11m
English
1 INTRODUCTION TO THE THEORY OF COMPUTATION
1.1 Mathematical Preliminaries and Notation
2.1 Deterministic Finite Accepters
2.2 Nondeterministic Finite Accepters
Definition of a Nondeterministic Accepter
2.3 Equivalence of Deterministic and Nondeterministic Finite Accepters
2.4 Reduction of the Number of States in Finite Automata*
3 REGULAR LANGUAGES AND REGULAR GRAMMARS
Formal Definition of a Regular Expression
Read now
Unlock full access