XDI comparison of MYC3 and C

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  1> (AND/IF_1.0
  2> ( NFA 
  3>    ( NAME MYC3)
  4>    ( NOTE  Generated by digg v1.0)
  5>    ( INTERPRETATION  Verhoeff/XDI)
  6>      (SYMBOLS
  7>        (p OUTPUT)
  8>        (q OUTPUT)
  9>        (a INPUT)
 10>       )
 11>      (STATES
 12>         (2 TRANSIENT) 
 13>         (3 BOX) 
 14>         (4 TRANSIENT) 
 15>         (5 BOX) 
 16>         (6 TRANSIENT) 
 17>         (7 BOX INITIAL) 
 18>      )
 19>      (TRANSITIONS 
 20>         (2 7 q)
 21>         (3 2 a)
 22>         (4 3 p)
 23>         (5 4 a)
 24>         (6 5 p)
 25>         (7 6 a)
 26>     )))
-----------------------------------------------------------------------------

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  2> (AND/IF_1.0
  3> (NFA 
  4>      (NAME C)
  5>      (INTERPRETATION Verhoeff/XDI)
  6>      (NOTE Generated by digg v1.0)
  7>      (SYMBOLS 
  8>               (a INPUT)
  9>               (p OUTPUT)
 10>               (q OUTPUT)
 11>      )
 12>      (STATES 
 13>         (0 BOX INITIAL)
 14>         (1 TRANSIENT)
 15>         (2 BOX)
 16>         (3 TRANSIENT)
 17>         (4 BOX)
 18>         (5 TRANSIENT)
 19>      )
 20>      (TRANSITIONS
 21>          (0 1 a)
 22>          (1 2 p)
 23>          (2 3 a)
 24>          (3 4 p)
 25>          (4 5 a)
 26>          (5 0 q)
 27>      )
 28> ))
-----------------------------------------------------------------------------

AND/IF_1.0 
( NFA 
   ( NAME MYC3)
   ( NOTE  Generated by digg v1.0)
   ( INTERPRETATION  Verhoeff/XDI)
     (SYMBOLS
       (

Alphabets

'MYC3' and 'C' have comparable alphabets

Joint Reachability

# reachable state pairs = 6
[ + == 9 < distance < +inf , . == distance = +inf ]

	0	1	2	3	4	5
2:	.	.	.	.	.	5
3:	.	.	.	.	4	.
4:	.	.	.	3	.	.
5:	.	.	2	.	.	.
6:	.	1	.	.	.	.
7:	0	.	.	.	.	.

Shortest distances and paths from initial pair

[(s,t)=state pair, d=distance, X\Y=not indiv. min., path=shortest path]

(s,t):	d,	X\Y,	path
(2,5):	5,	\ ,	a p a p a
(3,4):	4,	\ ,	a p a p
(4,3):	3,	\ ,	a p a
(5,2):	2,	\ ,	a p
(6,1):	1,	\ ,	a
(7,0):	0,	\ ,

Distribution of distances from initial pair

[d=distance, h=occurrence count, c=cumulative occurrence count]

d:	h	[c]
0:	1	[1]
1:	1	[2]
2:	1	[3]
3:	1	[4]
4:	1	[5]
5:	1	[6]

Comparison

'MYC3' refines 'C'.

Comparison Matrix:

	0	1	2	3	4	5
2:	1	1	1	1	1	.
3:	2	0	2	0	.	0
4:	1	3	1	.	1	1
5:	4	0	.	0	2	0
6:	1	.	1	3	1	1
7:	.	0	4	0	2	0

'MYC3' is refined by 'C'.
Comparison Matrix:

	0	1	2	3	4	5
2:	0	1	0	1	0	.
3:	2	1	2	1	.	1
4:	0	3	0	.	0	1
5:	4	1	.	1	2	1
6:	0	.	0	3	0	1
7:	.	1	4	1	2	1