Section outline

  • Deterministic Finite Automaton - Tutorialspoint

    The term "Automata" is derived from the Greek word "αὐτόματα" which means "self-acting". An automaton (Automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically.

    An automaton with a finite number of states is called a Finite Automaton (FA) or Finite State Machine (FSM).


    Objective of this Lecture:

    1) To understand automata and its types

    2) To know about finite automata and it's real life example

    3) Relate automata theory to the real world computer science

    4) To know about categories of Finite automata

    5) To recognize any automata 

    6) To know DFA and NFA Computation

    Outcome:

    1) Automata and it's categories

    2) Formal Definitions

    3) Differentiate DFA and NFA

    4) String Acceptance in DFA and NFA  (String Acceptance)

    Content:

    1) Finite automata and it's categories

    2) DFA and NFA formal definition

    3) DFA and NFA computation 

    • url icon
      Reference Book Link URL
      Students must
      View

      Introduction to Theory of Computation

    • resource icon
      Lecture 2 File
      Students must
      View
    • resource icon
      Lecture 2.1 File
      Students must
      View
    • assign icon
      Assignment 1
      Opened: Wednesday, 21 August 2024, 3:00 PM
      Due: Wednesday, 21 August 2024, 3:45 PM
      Students must
      View
      Make a submission

      Submit your class assignment here