XDI analysis of Non-Receptive Mixer
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 Non-Receptive Mixer)
4> (SYMBOLS
5> (r0 INPUT) (a0 OUTPUT) (r1 INPUT) (a1 OUTPUT)
6> (r OUTPUT) (a INPUT)
7> )
8>
9> (STATES
10> (0 INITIAL BOX)
11> (1 TRANSIENT)
12> (2 TRANSIENT)
13> (3 BOX)
14> (4 BOX)
15> (5 TRANSIENT)
16> (6 TRANSIENT)
17> )
18> (TRANSITIONS
19> (0 1 r0) (0 2 r1)
20> (1 3 r)
21> (2 4 r)
22> (3 5 a)
23> (4 6 a)
24> (5 0 a0)
25> (6 0 a1)
26> )
27> )
28> )
-----------------------------------------------------------------------------
Non-Receptive Mixer: warning: interpretation not given. Assuming 'Verhoeff/XDI'
Non-Receptive Mixer: 1 warning, 0 errors.
-
- 6 symbols:
- 3 input and 3 output
- 7 states:
- 0 demanding, 3 indifferent and 4 transient
- 8 transitions:
- 4 input and 4 output
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
0: | r0 | a0 | r1 | a1 | r | a |
0: | r1 | a1 | r0 | a0 | r | a |
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
/ r0 a0 r1 a1 / r a /
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
- 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
- All states are reachable from the initial state:
[ + == 9 < distance < +inf , . == distance = +inf ]
Initial state reachable from all states.
All states reachable from all other states.
- Shortest paths from initial state:
-
0: | |
1: | r0 |
2: | r1 |
3: | r0 r |
4: | r1 r |
5: | r0 r a |
6: | r1 r a |
- 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: | 2 | [5] |
3: | 2 | [7] |
Top | Statistics | Automorphisms | Finest Semi-independent 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 Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
'Non-Receptive Mixer' 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)
Copyright © 1995-1997 Eindhoven University of Technology