package fix

  1. Overview
  2. Docs

The signature DFA describes a deterministic finite-state automaton.

type states

The type states is a type-level representation of the number of states of the automaton. Thus, a state number has type states index. See Indexing for more information about type-level indices.

states is the number of states of the automaton.

type state = states Indexing.index

A state number is an integer in the range [0, cardinal states).

type transitions

The type transitions is a type-level representation of the number of transitions of the automaton. Thus, a transition number has type transitions index. See Indexing for more information about type-level indices.

val transitions : transitions Indexing.cardinal

transitions is the number of transitions of the automaton.

type transition = transitions Indexing.index

A transition number is an integer in the range [0, cardinal transitions).

type label

label is the type of transition labels.

val label : transition -> label

label t returns the label of the transition t.

val source : transition -> state

source t returns the source state of the transition t.

val target : transition -> state

target t returns the target state of the transition t.

val initials : state Enum.enum

initials is an enumeration of the initial states.

val finals : state Enum.enum

finals is an enumeration of the initial states.

OCaml

Innovation. Community. Security.