By five items of an NFA, it means this:

PLEASE BE SURE TO INCLUDE AN ACTUAL DRAWING OF THE DIAGRAM!!!

and keep in mind that it is a NFA not a DFA.

Lab 5 Give the transitional diagram and NFA five items to comprise an NFA for each of the below. 1. Design an NFA to recognize the language consisting of the string 101. 2. Design an NFA to recognize the language consisting of all strings beginning with 101. 3. Design an NFA to recognize the language consisting of all strings ending with 101 . A=(Q.,,q0,F) here: 1. Q is a finite set of states. 2. is a finite set of input symbols. 3. q0, a member of Q, is the start state. 4. F, a subset of Q, is the set of final (or accepting) states. 5. , the transition function is a function that takes a state in Q and an input symbol in as arguments and returns a subset of Q. Notice that the only difference between an NFA and a DFA is in the type of value that returns: a set of states in the case of an NFA and a single state in the case of a DFA