Scribd
Upload
66 views1 page

Formal Definition of A Finite Automaton: F Is A Set of Final State/states of Q (F Q

A finite automaton is a machine that can be represented by a 5-tuple consisting of a finite set of states Q, a finite alphabet of symbols Σ, a transition function δ, an initial state q0 from which input is processed, and a set of final states F that is a subset of the set of all states Q.

Uploaded by

Shaista Saeed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
66 views1 page

Formal Definition of A Finite Automaton: F Is A Set of Final State/states of Q (F Q

A finite automaton is a machine that can be represented by a 5-tuple consisting of a finite set of states Q, a finite alphabet of symbols Σ, a transition function δ, an initial state q0 from which input is processed, and a set of final states F that is a subset of the set of all states Q.

Uploaded by

Shaista Saeed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

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