# XDI analysis of L

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

```Processing AND/IF input stream:
-----------------------------------------------------------------------------
2> (AND/IF_1.0
3> (NFA
4>      (NAME L)
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 TRANSIENT)
23>         (6 TRANSIENT)
24>         (7 TRANSIENT)
25>      )
26>      (TRANSITIONS
27>          (0 1 a0)
28>          (0 2 b)
29>          (0 3 a1)
30>          (0 4 a2)
31>          (1 7 b)
32>          (2 7 a0)
33>          (2 6 a1)
34>          (2 5 a2)
35>          (3 6 b)
36>          (4 5 b)
37>          (5 0 c2)
38>          (6 0 c1)
39>          (7 0 c0)
40>      )
41> ))
-----------------------------------------------------------------------------

```

### Statistics

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

### Automorphisms (symmetries)

There are 6 automorphisms.
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Finest Semi-independent Partition

/ a0 b a1 a2 c0 c1 c2 /
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Choice, Order Dependence, Nondeterminism

• Maximally Transient
• Disabling inputs (Zinp) in state(s):
0 2
• 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:01111222

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

Shortest paths from initial state:
0: a0 b a1 a2 b a2 b a1 a0 b

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:3[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

'L' 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.0 (Feb 17 1998 20:34:43)