Header menu logo F# Header menu logo Averest

AutomatonSemi<'state> Type

Semi-symbolic automata have an explicit enumeration of states, initial and accepting states, but the inputs and outputs are represented by boolean formulas so that many transitions can be shared.

Record fields

Record Field Description

accept

Full Usage: accept

Field type: Set<'state>
Field type: Set<'state>

acptType

Full Usage: acptType

Field type: AcceptanceType
Field type: AcceptanceType

cstrGF

Full Usage: cstrGF

Field type: Set<Set<'state>>
Field type: Set<Set<'state>>

init

Full Usage: init

Field type: Set<'state>
Field type: Set<'state>

inputs

Full Usage: inputs

Field type: Set<BoolExpr>
Field type: Set<BoolExpr>

outputs

Full Usage: outputs

Field type: Set<BoolExpr>
Field type: Set<BoolExpr>

states

Full Usage: states

Field type: Set<'state>
Field type: Set<'state>

trans

Full Usage: trans

Field type: Set<'state * BoolExpr * 'state>
Field type: Set<'state * BoolExpr * 'state>

Type something to start searching.