Index of types


A
assignment [Languageops]
An assignment maps each transition list to a single transition (i.e., an elemtent in that list).

C
charset [Nfa]

D
delta [Nfa]

E
epsilon [Nfa]

G
graph [Depgraph]

H
hashset [Hashset]

I
inedge [Depgraph]

L
lang [Depgraph]
A node's language is one of Unrestricted: Equivalent to sigmastar, Machine: A normal NFA, SubMachine: See Depgraph.submachine, SuperMachine: See Depgraph.supermachine SubMachine and SuperMachine only used while solving CI-groups; after a specific assignment is selected, these are converted to regular NFAs.

N
nfa [Nfa]
Nfa with state type 'a, a single start state s, and a single accepting state f:
node [Depgraph]
Dependency graph node
nodeid [Depgraph]

O
outcome [Solve]
outedge [Depgraph]

S
set [Charset]
state [Interface]
state [Depgraph]
state [Nfa]
stateset [Nfa]
submachine [Depgraph]
submapping [Depgraph]
supermachine [Depgraph]
supermapping [Depgraph]
symbol [Nfa]

T
trans_list [Depgraph]
trans_list_id [Depgraph]
transition [Depgraph]