3.10ABAC030109

3.10ABAC030109 - 1 3.10. ABAC. Recall the reduced AB table...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 3.10. ABAC. Recall the reduced AB table from section 3.5. REDUCED AB 1. A . fA B . gA. INF. AL. ALF. FIN. NON. 2. A . fA B . gB. INF. AL. ALF. FIN. NON. 3. A . fA B . gC. INF. AL. ALF. FIN. NON. 4. C . fA B . gA. INF. AL. ALF. FIN. NON. 5. C . fA B . gB. INF. AL. ALF. FIN. NON. 6. C . fA B . gC. INF. AL. ALF. FIN. NON. The reduced AC table is obtained from the reduced AB table by interchanging B and C. We use 1'-6' to avoid confusion. REDUCED AC 1’. A . fA C . gA. INF. AL. ALF. FIN. NON. 2’. A . fA C . gC. INF. AL. ALF. FIN. NON. 3’. A . fA C . gB. INF. AL. ALF. FIN. NON. 4’. B . fA C . gA. INF. AL. ALF. FIN. NON. 5’. B . fA C . gC. INF. AL. ALF. FIN. NON. 6’. B . fA C . gB. INF. AL. ALF. FIN. NON. We will use the reduced AB table and the reduced AC table. Note that each i,j’ is equivalent to j,i’, because each i,j’ is sent to i’,j by interchanging B and C. Hence we need only consider i,j’ where i j’. We need to determine the status of INF, AL, ALF, FIN, NON for each pair. 1,1’. A . fA B . gA, A . fA C . gA. INF. AL. ALF. FIN. NON. 1,2’. A . fA B . gA, A . fA C . gC. INF. AL. ALF. FIN, NON. 1,3’. A . fA B . gA, A . fA C . gB. INF. AL. ALF. FIN. NON.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

3.10ABAC030109 - 1 3.10. ABAC. Recall the reduced AB table...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online