Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
Theory of Computation, Paperback / softback Book

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.


  • Format:Paperback / softback
  • Pages:128 pages
  • Publisher:LAP Lambert Academic Publishing
  • Publication Date:
  • Category:
  • ISBN:9786202513586



Free Home Delivery

on all orders

Pick up orders

from local bookshops

Also by Vishwajit Barbuddhe   |  View all