I have a basic understanding of truth tables and the addresses. My issue is that for every letter that I have to make, I need a truth table that represents A B C therefore the combinations of the word "CONEJO" have to be parallel to the times I find which is true and false. For example, letter C in boolean has to be 1001110 corresponding to abcdefg but as I go down to the other letters, O N J... they have to be accounted for and then simplified. In the symbol table, I need to include ABC from the truth table for how long my word is and the outputs have to (I believe) be equal to the 7 segments. The simplified version of C or as I'm calling it F(a)=A'B'C'+A'BC+AB'C. From here, I have to consider the display format, checking which segments will turn on and other will keep off. In C, A F E D will turn on while B G and C will keep off. My other issue is that for the amount of F(x) are simplified and added to the Networks, I don't know the next procedure.