XDI analysis of SEQ-Element

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  1> (AND/IF_1.0
  2>   (NFA
  3>     (NAME SEQ-Element)
  4>     (SYMBOLS 
  5>       (r INPUT) (a OUTPUT) (r0 OUTPUT) (a0 INPUT)
  6>       (r1 OUTPUT) (a1 INPUT)
  7>     )
  8> 
  9>     (STATES
 10>       (0 INITIAL BOX)
 11>       (1 TRANSIENT)
 12>       (2 BOX)
 13>       (3 TRANSIENT)
 14>       (4 BOX)
 15>       (5 TRANSIENT)
 16>     )
 17>     (TRANSITIONS
 18>       (0 1 r)
 19>       (1 2 r0)
 20>       (2 3 a0)
 21>       (3 4 r1)
 22>       (4 5 a1)
 23>       (5 0 a)
 24>     )
 25>   )
 26> )
-----------------------------------------------------------------------------

SEQ-Element: warning: interpretation not given. Assuming 'Verhoeff/XDI'
SEQ-Element: 1 warning, 0 errors.

Statistics

6 symbols:

3 input and 3 output

6 states:

0 demanding, 3 indifferent and 3 transient

6 transitions:

3 input and 3 output

Automorphisms (symmetries)

There are 3 automorphisms.

Finest Semi-independent Partition

/ r a / r0 a0 / r1 a1 /

Choice, Order Dependence, Nondeterminism

• Maximally Transient
• No Disabling Inputs (Z^inp)
• No Disabling Outputs (Z^out)
• Order-Independent input (Y^inp)
• Order-Independent output (Y^out)
• Output refusal sets propate backward over inputs
• Output Deterministic

Distances

All states are reachable from the initial state:
[ + == 9 < distance < +inf , . == distance = +inf ]

	0	1	2	3	4	5
0:	0	1	2	3	4	5

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

Shortest paths from initial state:

0:
1:	r
2:	r r0
3:	r r0 a0
4:	r r0 a0 r1
5:	r r0 a0 r1 a1

Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count]

d:	h	[c]
0:	1	[1]
1:	1	[2]
2:	1	[3]
3:	1	[4]
4:	1	[5]
5:	1	[6]

Autocomparison Matrix

There are no state pairs (x,y) where x refines y outside the diagonal.

XDI Validity

'SEQ-Element' is a valid XDI specification.