XDI analysis of E-Element

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 E-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 BOX)
 14>       (4 TRANSIENT)
 15>       (5 BOX)
 16>       (6 TRANSIENT)
 17>       (7 BOX)
 18>       (8 BOX)
 19>       (9 TRANSIENT)
 20>     )
 21>     (TRANSITIONS
 22>       (0 1 r)
 23>       (1 2 r0) (1 3 r1)
 24>       (2 4 a0) (2 5 r1)
 25>       (3 5 r0) (3 6 a1)
 26>       (4 7 r1)
 27>       (5 7 a0) (5 8 a1)
 28>       (6 8 r0)
 29>       (7 9 a1)
 30>       (8 9 a0)
 31>       (9 0 a)
 32>     )
 33>   )
 34> )
-----------------------------------------------------------------------------

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


Statistics

6 symbols:
3 input and 3 output
10 states:
0 demanding, 6 indifferent and 4 transient
14 transitions:
7 input and 7 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

/ r a / r0 a0 / r1 a1 /
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity


Choice, Order Dependence, Nondeterminism

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 ]
  0123456789
0:0122333445

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

Shortest paths from initial state:
0:
1:
2:r r0 
3:r r1 
4:r r0 a0 
5:r r0 r1 
6:r r1 a1 
7:r r0 a0 r1 
8:r r0 r1 a1 
9:r r0 a0 r1 a1 

Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count]
d:h[ c]
0:11]
1:12]
2:24]
3:37]
4:29]
5:1[10]
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

'E-Element' 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