XDI analysis of DC
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity
Processing AND/IF input stream:

2> (AND/IF_1.0
3> (NFA
4> (NAME DC)
5> (INTERPRETATION Verhoeff/XDI)
6> (NOTE Generated by digg v1.0)
7> (SYMBOLS
8> (a0 INPUT)
9> (b0 INPUT)
10> (a1 INPUT)
11> (b1 INPUT)
12> (a2 INPUT)
13> (c00 OUTPUT)
14> (c10 OUTPUT)
15> (c01 OUTPUT)
16> (c20 OUTPUT)
17> (c11 OUTPUT)
18> (c21 OUTPUT)
19> )
20> (STATES
21> (0 BOX INITIAL)
22> (1 BOX)
23> (2 BOX)
24> (3 BOX)
25> (4 BOX)
26> (5 BOX)
27> (6 TRANSIENT)
28> (7 TRANSIENT)
29> (8 TRANSIENT)
30> (9 TRANSIENT)
31> (10 TRANSIENT)
32> (11 TRANSIENT)
33> )
34> (TRANSITIONS
35> (0 1 a0)
36> (0 2 b0)
37> (0 3 a1)
38> (0 4 b1)
39> (0 5 a2)
40> (1 11 b0)
41> (1 8 b1)
42> (2 11 a0)
43> (2 10 a1)
44> (2 6 a2)
45> (3 10 b0)
46> (3 9 b1)
47> (4 8 a0)
48> (4 9 a1)
49> (4 7 a2)
50> (5 6 b0)
51> (5 7 b1)
52> (6 0 c20)
53> (7 0 c21)
54> (8 0 c01)
55> (9 0 c11)
56> (10 0 c10)
57> (11 0 c00)
58> )
59> ))


 11 symbols:
 5 input and 6 output
 12 states:
 0 demanding, 6 indifferent and 6 transient
 23 transitions:
 17 input and 6 output
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

There are 12 automorphisms.
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

/ a0 b0 a1 b1 a2 c00 c10 c01 c20 c11 c21 /
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity
 Maximally Transient
 Disabling inputs (Z^{inp}) in state(s):
 0 1 2 3 4 5
 No Disabling Outputs (Z^{out})
 OrderIndependent input (Y^{inp})
 OrderIndependent output (Y^{out})
 Output refusal sets propate backward over inputs
 Output Deterministic
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity
 All states are reachable from the initial state:
[ + == 9 < distance < +inf , . == distance = +inf ]
           1  1 
 0  1  2  3  4  5  6  7  8  9  0  1 
0:  0  1  1  1  1  1  2  2  2  2  2  2 
Initial state reachable from all states.
All states reachable from all other states.
 Shortest paths from initial state:

0:  
1:  a0 
2:  b0 
3:  a1 
4:  b1 
5:  a2 
6:  b0 a2 
7:  b1 a2 
8:  a0 b1 
9:  a1 b1 
10:  b0 a1 
11:  a0 b0 
 Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count] 
d:  h  [ c] 
0:  1  [ 1] 
1:  5  [ 6] 
2:  6  [12] 
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

There are no state pairs (x,y) where x refines y outside the diagonal.
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

'DC' is a valid XDI specification.
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity
XDI State Graph Tool, Version 2.0 (Feb 17 1998 20:34:43)
Copyright © 19951997 Eindhoven University of Technology