XDI analysis of CALL

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  2> (AND/IF_1.0
  3> (NFA 
  4>      (NAME CALL)
  5>      (INTERPRETATION Verhoeff/XDI)
  6>      (NOTE Generated by digg v1.0)
  7>      (SYMBOLS 
  8>               (a0 INPUT)
  9>               (b INPUT)
 10>               (a1 INPUT)
 11>               (a2 INPUT)
 12>               (c OUTPUT)
 13>               (d0 OUTPUT)
 14>               (d1 OUTPUT)
 15>               (d2 OUTPUT)
 16>      )
 17>      (STATES 
 18>         (0 BOX INITIAL)
 19>         (1 TRANSIENT)
 20>         (2 BOX)
 21>         (3 TRANSIENT)
 22>         (4 TRANSIENT)
 23>         (5 TRANSIENT)
 24>         (6 BOX)
 25>         (7 TRANSIENT)
 26>         (8 TRANSIENT)
 27>         (9 BOX)
 28>         (10 TRANSIENT)
 29>         (11 TRANSIENT)
 30>         (12 TRANSIENT)
 31>         (13 TRANSIENT)
 32>         (14 TRANSIENT)
 33>         (15 BOX)
 34>      )
 35>      (TRANSITIONS
 36>          (0 1 a0)
 37>          (0 2 b)
 38>          (0 3 a1)
 39>          (0 4 a2)
 40>          (1 13 b)
 41>          (1 15 c)
 42>          (2 13 a0)
 43>          (2 8 a1)
 44>          (2 5 a2)
 45>          (3 8 b)
 46>          (3 9 c)
 47>          (4 5 b)
 48>          (4 6 c)
 49>          (5 7 c)
 50>          (5 11 d2)
 51>          (6 7 b)
 52>          (7 0 d2)
 53>          (8 10 c)
 54>          (8 11 d1)
 55>          (9 10 b)
 56>          (10 0 d1)
 57>          (11 12 b)
 58>          (11 0 c)
 59>          (12 2 c)
 60>          (13 14 c)
 61>          (13 11 d0)
 62>          (14 0 d0)
 63>          (15 14 b)
 64>      )
 65> ))
-----------------------------------------------------------------------------

Statistics

8 symbols:

4 input and 4 output

16 states:

0 demanding, 5 indifferent and 11 transient

28 transitions:

14 input and 14 output

Automorphisms (symmetries)

There are 6 automorphisms.

Finest Semi-independent Partition

/ a0 b a1 a2 c d0 d1 d2 /

Choice, Order Dependence, Nondeterminism

• Maximally Transient
• Disabling inputs (Z^inp) in state(s):

  0 2

• 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 ]

											1	1	1	1	1	1
	0	1	2	3	4	5	6	7	8	9	0	1	2	3	4	5
0:	0	1	1	1	1	2	2	3	2	2	3	3	4	2	3	2

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

Shortest paths from initial state:

0:
1:	a0
2:	b
3:	a1
4:	a2
5:	b a2
6:	a2 c
7:	b a2 c
8:	b a1
9:	a1 c
10:	b a1 c
11:	a0 b d0
12:	a0 b d0 b
13:	a0 b
14:	a0 b c
15:	a0 c

Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count]

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

Autocomparison Matrix

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

XDI Validity

'CALL' is a valid XDI specification.