Which of the following is a not a part of 5-tuple finite automata?

Which of the following is a not a part of 5-tuple finite automata?
Output Alphabet
Well Done. A FA can be represented as FA= (Q, ∑, δ, q0, F) where Q=Finite Set of States, ∑=Finite Input Alphabet, δ=Transition Function, q0=Initial State, F=Final/Acceptance State).
Input alphabet
Transition function
Initial State

Leave a Reply

Your email address will not be published. Required fields are marked *