# XDI analysis of M

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 M)
5>      (INTERPRETATION Verhoeff/XDI)
6>      (NOTE Generated by digg v1.0)
7>      (SYMBOLS
8>               (a0 INPUT)
9>               (a1 INPUT)
10>               (a2 INPUT)
11>               (b OUTPUT)
12>      )
13>      (STATES
14>         (0 BOX INITIAL)
15>         (1 TRANSIENT)
16>      )
17>      (TRANSITIONS
18>          (0 1 a0)
19>          (0 1 a1)
20>          (0 1 a2)
21>          (1 0 b)
22>      )
23> ))
-----------------------------------------------------------------------------

### Statistics

4 symbols:
3 input and 1 output
2 states:
0 demanding, 1 indifferent and 1 transient
4 transitions:
3 input and 1 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 a1 a2 b /
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
• 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 ]
01
0:01

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

Shortest paths from initial state:
0: a0

Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count]
d:h[c]
0:1[1]
1:1[2]
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

'M' 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)