XDI analysis of Initialized Non-Receptive 1-Bit Variable

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 Initialized Non-Receptive 1-Bit Variable)
  4>     (SYMBOLS 
  5>       (w0 INPUT )
  6>       (w1 INPUT )
  7>       (a OUTPUT)
  8>       (r INPUT )
  9>       (v0 OUTPUT)
 10>       (v1 OUTPUT)
 11>     )
 12>     (STATES
 13>       (0 INITIAL BOX)
 14>       (1 BOX)
 15>       (2 TRANSIENT)
 16>       (3 TRANSIENT)
 17>       (4 TRANSIENT)
 18>       (5 TRANSIENT)
 19>     )
 20>     (TRANSITIONS
 21>       (0 2 w0) (0 3 w1) (0 4 r)
 22>       (1 2 w0) (1 3 w1) (1 5 r)
 23>       (2 0 a)
 24>       (3 1 a)
 25>       (4 0 v0)
 26>       (5 1 v1)
 27>     )
 28>   )
 29> )
-----------------------------------------------------------------------------

Initialized Non-Receptive 1-Bit Variable: warning: interpretation not given. Assuming 'Verhoeff/XDI'
Initialized Non-Receptive 1-Bit Variable: 1 warning, 0 errors.


Statistics

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

/ w0 w1 a r v0 v1 /
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 ]
  012345
0:021113

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

Shortest paths from initial state:
0:
1:w1 a 
2:w0 
3:w1 
4:
5:w1 a r 

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:1[5]
3:1[6]
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

'Initialized Non-Receptive 1-Bit Variable' 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