XDI comparison of C and C

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> ))
-----------------------------------------------------------------------------

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 C)
     (INTERPRETATION Verhoeff/XDI)
     (NOTE Generated by digg v1.0)
     (SYMBOLS 
         

Alphabets

'C' and 'C' have comparable alphabets

Joint Reachability

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

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

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
(0,0):	0,	\ ,
(1,1):	1,	\ ,	a
(2,2):	2,	\ ,	a p
(3,3):	3,	\ ,	a p a
(4,4):	4,	\ ,	a p a p
(5,5):	5,	\ ,	a p a p a

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

'C' refines 'C'.

Comparison Matrix:

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

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

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