# XDI analysis of One-All

Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

```Processing AND/IF input stream:
-----------------------------------------------------------------------------
1> (AND/IF_1.0
2>   (NFA
3>     (NAME One-All)
4>     (SYMBOLS
5>       (a INPUT) (b INPUT) (c OUTPUT) (d OUTPUT)
6>     )
7>
8>     (STATES
9>       (0 INITIAL BOX)
10>       (1 TRANSIENT)
11>       (2 TRANSIENT)
12>       (3 TRANSIENT)
13>       (4 BOX)
14>       (5 BOX)
15>       (6 TRANSIENT)
16>       (7 TRANSIENT)
17>     )
18>     (TRANSITIONS
19>       (0 1 a) (0 2 b)
20>       (1 3 b) (1 4 c)
21>       (2 3 a) (2 5 c)
22>       (3 6 c) (3 7 d)
23>       (4 6 b)
24>       (5 6 a)
25>       (6 0 d)
26>       (7 0 c)
27>     )
28>   )
29> )
-----------------------------------------------------------------------------

One-All: warning: interpretation not given. Assuming 'Verhoeff/XDI'
One-All: 1 warning, 0 errors.

```

### Statistics

4 symbols:
2 input and 2 output
8 states:
0 demanding, 3 indifferent and 5 transient
12 transitions:
6 input and 6 output
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Automorphisms (symmetries)

 0: 0: a b c d b a c d
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Finest Semi-independent Partition

/ a b c d /
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Choice, Order Dependence, Nondeterminism

• Maximally Transient
• No Disabling Inputs (Zinp)
• No Disabling Outputs (Zout)
• Order-Independent input (Yinp)
• Order-Independent output (Yout)
• Output refusal sets propate backward over inputs
• Output Deterministic
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Distances

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

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

Shortest paths from initial state:
0: a b a b a c b c a b c a b d

Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count]
d:h[c]
0:1[1]
1:2[3]
2:3[6]
3:2[8]
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Autocomparison Matrix

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

Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### XDI Validity

'One-All' is a valid XDI specification.

Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

XDI State Graph Tool, Version 2.1.1 (Jun 26 1998 10:51:42)