XDI analysis of T

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

Statistics

4 symbols:

1 input and 3 output

6 states:

0 demanding, 3 indifferent and 3 transient

6 transitions:

3 input and 3 output

Automorphisms (symmetries)

0:	a	b0	b1	b2
2:	a	b1	b2	b0
4:	a	b2	b0	b1

Finest Semi-independent Partition

/ a b0 b1 b2 /

Choice, Order Dependence, Nondeterminism

• Maximally Transient
• No Disabling Inputs (Z^inp)
• No Disabling Outputs (Z^out)
• Order-Independent input (Y^inp)
• Order-Independent output (Y^out)
• Output refusal sets propate backward over inputs
• Output Deterministic

Distances

All states are reachable from the initial state:
[ + == 9 < distance < +inf , . == distance = +inf ]

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

Initial state reachable from all states.
All states reachable from all other states.

Shortest paths from initial state:

0:
1:	a
2:	a b0
3:	a b0 a
4:	a b0 a b1
5:	a b0 a b1 a

Distribution of distances from initial state:
[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]

Autocomparison Matrix

There are no state pairs (x,y) where x refines y outside the diagonal.

XDI Validity

'T' is a valid XDI specification.