Theory of Computation Paperback / softback
Paperback / softback
The book contains: Introduction to Automata: The Methods Introduction to Finite Automata, Structural Representations, Automata and Complexity.
Proving Equivalences about Sets, The Contrapositive, Proof by Contradiction, Inductive Proofs: General Concepts of Automata Theory: Alphabets Strings, Languages, Applications of Automata Theory.
Finite Automata: The Ground Rules, The Protocol, Deterministic Finite Automata: Definition of a Deterministic Finite Automata, How a DFA Processes Strings, Simpler Notations for DFA's, Extending the Transition Function to Strings, The Language of a DFA Nondeterministic Finite Automata: An Informal View.
The Extended Transition Function, The Languages of an NFA, Equivalence of Deterministic and Non-deterministic Finite Automata.
Finite Automata With Epsilon-Transitions: Uses of âˆˆ-Transitions, The Formal Notation for an âˆˆ-NFA, Epsilon-Closures, Extended Transitions and Languages for âˆˆ-NFA's, Eliminating âˆˆ-Transitions.