Short Answer
Find all strings recognized by this deterministic finite-state automaton. 
Definitions:
Related Questions
Q2: If <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB34225555/.jpg" alt="If represents
Q10: In the graph shown below, how many
Q10: Find a Boolean function <span
Q18: Refer to the information shown above ;
Q23: At the local ice-cream stand a Super
Q27: Write 1 as a sum-of-products in the
Q29: Using the ordering B, G, J, A,
Q35: For the weighted graph given below, use
Q40: Suppose you have 100 identical marbles and
Q71: List the relations on the set {0,