XDI analysis of S
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 S)
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> (c0 OUTPUT)
13> (c1 OUTPUT)
14> (c2 OUTPUT)
15> )
16> (STATES
17> (0 BOX INITIAL)
18> (1 BOX)
19> (2 BOX)
20> (3 BOX)
21> (4 BOX)
22> (5 BOX)
23> (6 TRANSIENT)
24> (7 BOX)
25> (8 BOX)
26> (9 TRANSIENT)
27> (10 TRANSIENT)
28> (11 BOX)
29> (12 TRANSIENT)
30> (13 TRANSIENT)
31> (14 TRANSIENT)
32> (15 TRANSIENT)
33> )
34> (TRANSITIONS
35> (0 1 a0)
36> (0 2 b)
37> (0 3 a1)
38> (0 4 a2)
39> (1 14 b)
40> (1 11 a1)
41> (1 5 a2)
42> (2 14 a0)
43> (2 12 a1)
44> (2 6 a2)
45> (3 11 a0)
46> (3 12 b)
47> (3 7 a2)
48> (4 5 a0)
49> (4 6 b)
50> (4 7 a1)
51> (5 15 b)
52> (5 8 a1)
53> (6 15 a0)
54> (6 9 a1)
55> (6 0 c2)
56> (7 8 a0)
57> (7 9 b)
58> (8 10 b)
59> (9 10 a0)
60> (9 4 c1)
61> (9 3 c2)
62> (10 7 c0)
63> (10 5 c1)
64> (10 11 c2)
65> (11 13 b)
66> (11 8 a2)
67> (12 13 a0)
68> (12 9 a2)
69> (12 0 c1)
70> (13 10 a2)
71> (13 3 c0)
72> (13 1 c1)
73> (14 13 a1)
74> (14 15 a2)
75> (14 0 c0)
76> (15 10 a1)
77> (15 4 c0)
78> (15 1 c2)
79> )
80> ))


 7 symbols:
 4 input and 3 output
 16 states:
 0 demanding, 9 indifferent and 7 transient
 44 transitions:
 32 input and 12 output
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

0:  a0  b  a1  a2  c0  c1  c2 
0:  a0  b  a2  a1  c0  c2  c1 
0:  a1  b  a0  a2  c1  c0  c2 
0:  a1  b  a2  a0  c1  c2  c0 
0:  a2  b  a0  a1  c2  c0  c1 
0:  a2  b  a1  a0  c2  c1  c0 
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

/ a0 b a1 a2 c0 c1 c2 /
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity
 Maximally Transient
 No Disabling Inputs (Z^{inp})
 Disabling outputs (Z^{out}) in state(s):
 9 10 13 15
 OrderIndependent input (Y^{inp})
 OrderIndependent output (Y^{out})
 Output refusal sets do NOT propagate backward over inputs in state(s):
 6 9 12 13 14 15
 Output NonDeterministic
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  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  2  3  3  4  2  2  3  2  3 
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:  a0 a2 
6:  b a2 
7:  a1 a2 
8:  a0 a1 a2 
9:  b a1 a2 
10:  a0 b a1 a2 
11:  a0 a1 
12:  b a1 
13:  a0 b a1 
14:  a0 b 
15:  a0 b a2 
 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] 
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

'S' 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.1.1 (Jun 26 1998 10:51:42)
Copyright © 19951997 Eindhoven University of Technology