# XDI analysis of Merge

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 Merge)
4>     (SYMBOLS
5>       (a INPUT) (b INPUT) (c OUTPUT)
6>     )
7>
8>     (STATES
9>       (0 INITIAL BOX)
10>       (1 TRANSIENT)
11>     )
12>     (TRANSITIONS
13>       (0 1 a) (0 1 b)
14>       (1 0 c)
15>     )
16>   )
17> )
-----------------------------------------------------------------------------

Merge: warning: interpretation not given. Assuming 'Verhoeff/XDI'
Merge: 1 warning, 0 errors.

```

### Statistics

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

### Automorphisms (symmetries)

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

### Finest Semi-independent Partition

/ a b c /
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: a

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

'Merge' 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)
Copyright © 1995-1997 Eindhoven University of Technology