package grenier

You can search for identifiers within the package.

in-package search v0.2.0

A collection of various algorithms in OCaml

Install

sha256=658e1ad6fc5fdce0871975b3ebcb3ec760248be63cdb9ea965e3121cc7478d77

sha512=d9ff83f1b025f34c22af5921444993df219761dcee8d8cb5a940f266df8677278967434b22314c5c82d5d983e4c94c04cd52c4717d5c1f22fbd3a022631fae1c

module DFA : DFA

include DFA with module Label = DFA.Label

Sourcemodule States : Strong.Finite.Set

Sourcemodule Transitions : Strong.Finite.Set

Sourcemodule Label = DFA.Label

Sourceval label : Transitions.n Strong.Finite.elt -> Label.t

Sourceval source : Transitions.n Strong.Finite.elt -> States.n Strong.Finite.elt

Sourceval target : Transitions.n Strong.Finite.elt -> States.n Strong.Finite.elt

Sourceval initial_state : States.n Strong.Finite.elt

module Final : 
  Strong.Finite.Map with type codomain = States.n Strong.Finite.elt

val transport_state : 
  DFA.States.n Strong.Finite.elt ->
  States.n Strong.Finite.elt option

val transport_transition : 
  DFA.Transitions.n Strong.Finite.elt ->
  Transitions.n Strong.Finite.elt option

val represent_state : 
  States.n Strong.Finite.elt ->
  DFA.States.n Strong.Finite.elt

val represent_transition : 
  Transitions.n Strong.Finite.elt ->
  DFA.Transitions.n Strong.Finite.elt

On This Page