XDI analysis of Sequencer
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 Sequencer)
4> (SYMBOLS
5> (a0 INPUT) (a1 INPUT) (b INPUT) (c0 OUTPUT)
6> (c1 OUTPUT)
7> )
8>
9> (STATES
10> (0 INITIAL BOX)
11> (1 BOX)
12> (2 BOX)
13> (4 BOX)
14> (3 BOX)
15> (5 TRANSIENT)
16> (6 TRANSIENT)
17> (7 TRANSIENT)
18> )
19> (TRANSITIONS
20> (0 1 a0) (0 2 a1) (0 4 b)
21> (1 3 a1) (1 5 b)
22> (2 3 a0) (2 6 b)
23> (4 5 a0) (4 6 a1)
24> (3 7 b)
25> (5 7 a1) (5 0 c0)
26> (6 7 a0) (6 0 c1)
27> (7 2 c0) (7 1 c1)
28> )
29> )
30> )
-----------------------------------------------------------------------------
Sequencer: warning: interpretation not given. Assuming 'Verhoeff/XDI'
Sequencer: 1 warning, 0 errors.
-
- 5 symbols:
- 3 input and 2 output
- 8 states:
- 0 demanding, 5 indifferent and 3 transient
- 16 transitions:
- 12 input and 4 output
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
There are 2 automorphisms.
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
/ a0 a1 b c0 c1 /
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
- Maximally Transient
- No Disabling Inputs (Zinp)
- Disabling outputs (Zout) in state(s):
- 7
- Order-Independent input (Yinp)
- Order-Independent output (Yout)
- Output refusal sets do NOT propagate backward over inputs in state(s):
- 5 6
- Output Non-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: | a0 |
2: | a1 |
4: | b |
3: | a0 a1 |
5: | a0 b |
6: | a1 b |
7: | a0 a1 b |
- Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count] -
d: | h | [c] |
0: | 1 | [1] |
1: | 3 | [4] |
2: | 3 | [7] |
3: | 1 | [8] |
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
-
'Sequencer' 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