Scribd Logo
Upload

Welcome to Scribd!

  • 38 views

    Automata - What Is It?: Formal Definition of A Finite Automaton

    Uploaded by

    Shaista Saeed
    An automaton is a self-acting computing device that follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a finite automaton or finite state machine. A finite automaton can be represented by a 5-tuple consisting of a finite set of states, a finite alphabet, a transition function, an initial state, and a set of final or accepting states.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Automata - What Is It?: Formal Definition of A Finite Automaton

    Uploaded by

    Shaista Saeed
    38 views1 page
    An automaton is a self-acting computing device that follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a finite automaton or finite state machine. A finite automaton can be represented by a 5-tuple consisting of a finite set of states, a finite alphabet, a transition function, an initial state, and a set of final or accepting states.

    Original Title

    k.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    An automaton is a self-acting computing device that follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a finite automaton or finite state machine. A finite automaton can be represented by a 5-tuple consisting of a finite set of states, a finite alphabet, a transition function, an initial state, and a set of final or accepting states.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    38 views1 page

    Automata - What Is It?: Formal Definition of A Finite Automaton

    Uploaded by

    Shaista Saeed
    An automaton is a self-acting computing device that follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a finite automaton or finite state machine. A finite automaton can be represented by a 5-tuple consisting of a finite set of states, a finite alphabet, a transition function, an initial state, and a set of final or accepting states.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 1

    Automata – What is it?

    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).

    Formal definition of a Finite Automaton

    An automaton can be represented by a 5-tuple (Q, ∑, δ, q 0, F), where −


     Q is a finite set of states.
     ∑ is a finite set of symbols, called the alphabet of the automaton.
     δ is the transition function.
     q0 is the initial state from where any input is processed (q 0 ∈ Q).
    F is a set of final state/states of Q (F ⊆ Q

    You might also like