Short Answer
Find all strings recognized by this deterministic finite-state automaton. 
Definitions:
Related Questions
Q7: Which of the graphs shown below are
Q13: Use backtracking to find a sum of
Q16: Mary is fascinated with rocks and she
Q30: Find a formula for the number
Q32: Consider the digraph shown above ; which
Q35: Consider Graph K shown below; which of
Q36: Suppose T is a full m-ary tree
Q54: When written as a product of
Q59: The incidence matrix for Q5 has rows
Q121: How many ways are there to choose