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

MCQOPTIONS

1.	Which of the following is not a part of 5-tuple finite automata?
A.	Input alphabet
B.	Transition function
C.	Initial State
D.	Output Alphabet
Answer» E.

Discussion

No Comment Found

Related MCQs

The number of elements in the set for the Language L={x ( r) *|length if x is at most 2} and ={0,1} is _________
Which of the following is not a part of 5-tuple finite automata?
Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitions<br>Hint: Nodes and Edges are for trees and forests too.
A regular language over an alphabet is one that cannot be obtained from the basic languages using the operation