A | |
accepts [Acceptors.ACCEPTOR_TYPE] |
Returns
true iff the acceptor accepts the word represented by the
string.
|
accepts_wordSet [Acceptors.ACCEPTOR_TYPE] |
Returns a pair of wordsets: the first member of the pair are the words
accepted by the acceptor, the second member are those words not accepted.
|
are_compatible [Symbols.SYMBOL_SEED] |
Returns whether or not two elements are compatible.
|
are_isomorphic [Machines.MACHINE_TYPE] |
Returns
true iff the two machines are isomorphic.
|
are_unifiable [Symbols.SYMBOL_TYPE] |
Two symbols are unifiable iff one of them is universal, they are both
empty, or they are compatible
x types.
|
B | |
b_successors [Acceptors.ACCEPTOR_TYPE] |
Returns a partition of the states of the acceptor according to whether
or not they share b-successors.
|
blank [Symbols.SYMBOL_TYPE] |
The empty symbol.
|
C | |
complement [Acceptors.ACCEPTOR_TYPE] |
Returns the complement acceptor.
|
complete_determinize [Acceptors.ACCEPTOR_TYPE] |
Returns a determinized version of the finite state acceptor such that
there is an edge for every (state,label) pair.
|
concat [Acceptors.ACCEPTOR_TYPE] | concat fsa1 fsa2 returns an acceptor which accepts words in the language formed by
concatenating the language of fsa1 with the language of fsa2 .
|
conform [Symbols.SYMBOL_SEED] |
Returns an element given two elements.
|
conform [Symbols.SYMBOL_TYPE] |
If
s1 and s2 are symbols of type x then conform s1 s2 returns
the value of conform for the elements as defined by the module of type
SYMBOL_SEED .
|
D | |
determinize [Acceptors.ACCEPTOR_TYPE] |
Returns a determinized version of the finite state acceptor which has
trimmed useless states and edges.
|
E | |
edges [Machines.MACHINE_TYPE] |
Returns the edges of the machine.
|
empty [Machines.MACHINE_TYPE] |
The empty machine.
|
equal [Machines.MACHINE_TYPE] |
Returns
true iff the two machines have equal components.
|
extend [Acceptors.ACCEPTOR_TYPE] | extend fsa word returns an acceptor which adds word to the language
it accepts.
|
extend_pt [Acceptors.ACCEPTOR_TYPE] | extend_pt fsa word extends fsa .
|
F | |
finals [Machines.MACHINE_TYPE] |
Returns the final states of the machine.
|
G | |
generate [Acceptors.ACCEPTOR_TYPE] | generate fsa min max Returns a set of words of length between min and max that fsa accepts.
|
generate_p [Acceptors.ACCEPTOR_TYPE] | generate_p fsa min max Prints to standard output words of length min and max that fsa accepts.
|
I | |
inter [Machines.MACHINE_TYPE] | inter m1 m2 returns the intersection of t1 and t2 .
|
is_cyclic [Machines.MACHINE_TYPE] |
Returns
true iff the machine is cyclic.
|
is_deterministic [Acceptors.ACCEPTOR_TYPE] |
Returns
true iff the finite state acceptor is deterministic.
|
is_final_eqr [Acceptors.ACCEPTOR_TYPE] |
Returns a partition of the states of the acceptor so that all final
states are in the same block.
|
is_nd [Acceptors.ACCEPTOR_TYPE] | is_nd j k t returns true iff t is j-k-neighborhood-distinct.
|
is_nonfinal_eqr [Acceptors.ACCEPTOR_TYPE] |
Returns a partition of the states of the acceptor so that all nonfinal
states are in the same block.
|
is_nonstart_eqr [Acceptors.ACCEPTOR_TYPE] |
Returns a partition of the states of the acceptor so that all nonstart
states are in the same block.
|
is_start_eqr [Acceptors.ACCEPTOR_TYPE] |
Returns a partition of the states of the acceptor so that all start
states are in the same block.
|
is_stripped [Machines.MACHINE_TYPE] |
Returns
true iff the machine has no useless states.
|
J | |
jk_nhoods_eqr [Acceptors.ACCEPTOR_TYPE] | jk_nhoods j k fsa returns a partition of the states of fsa according
so that states with the same j-k-neighborhood are in the same block.
|
K | |
k_followers [Acceptors.ACCEPTOR_TYPE] | k_followers n nodeSet edgeSet returns all words of length less than or
equal to n that can be reached from nodeSet .
|
k_followers_eqr [Acceptors.ACCEPTOR_TYPE] |
Returns a partition of the states of the acceptor so that all states
with the same k_followers are in the same block.
|
k_leaders [Acceptors.ACCEPTOR_TYPE] | k_leaders n nodeSet edgeSet returns all words of length less than or
equal to n for which there exists a path to a node in nodeSet .
|
k_leaders_eqr [Acceptors.ACCEPTOR_TYPE] |
Returns a partition of the states of the acceptor so that all states
with the same k_leaders are in the same block.
|
L | |
label [Edges.EDGE_TYPE] |
Returns the label of an edge.
|
label_compare [Edges.EDGE_TYPE] |
This is the compare function for labels.
|
M | |
make [Machines.MACHINE_TYPE] | make s f e returns a machine with start states equal to s , final
states equal to f and edges equal to e .
|
make [Edges.EDGE_TYPE] | make o t l Returns an edge where the origin is o , the terminus is
t and the label is l .
|
make_fin [Acceptors.ACCEPTOR_TYPE] | |
make_pt [Acceptors.ACCEPTOR_TYPE] | make_pt filename returns a prefix tree from a file containing a list of
words.
|
make_pt2 [Acceptors.ACCEPTOR_TYPE] | make_pt2 filename returns a prefix tree from a file containing a list
of words.
|
make_range_fsa [Acceptors.ACCEPTOR_TYPE] | make_range-fsa filename returns an acceptor for the samllest
range-distinct language which accepts the words in filename .
|
make_st [Acceptors.ACCEPTOR_TYPE] | make_st filename returns a suffix tree from a file containing a list
of words.
|
make_st2 [Acceptors.ACCEPTOR_TYPE] | make_st2 filename returns a suffix tree from a file containing a list
of words.
|
merge [Acceptors.ACCEPTOR_TYPE] | merge fsa equiv_relation ultimately returns an acceptor in which the
partition of the states of fsa induced by equiv_relation is the
trivial partition (i.e.
|
merge1 [Acceptors.ACCEPTOR_TYPE] | merge1 fsa pi returns the acceptor which results from merging the
blocks of partition pi .
|
merge1_ns [Acceptors.ACCEPTOR_TYPE] | merge1_ns fsa ns returns the acceptor which results from merging the
nodes in ns .
|
minimize [Acceptors.ACCEPTOR_TYPE] |
Returns the smallest deterministic acceptor given some acceptor.
|
N | |
nodes [Machines.MACHINE_TYPE] |
Returns the nodes of the machine.
|
O | |
of_file [Machines.MACHINE_TYPE] | of_file filename returns a finite state machine from reading file
filename .
|
of_x [Symbols.SYMBOL_TYPE] |
Returns a symbol given
x .
|
origin [Edges.EDGE_TYPE] |
Returns the origin of an edge.
|
P | |
print_edgeMap [Acceptors.ACCEPTOR_TYPE] |
Prints to standard output the edges of the acceptor as a map from
(state,label) pairs to node sets.
|
print_wordSet [Acceptors.ACCEPTOR_TYPE] |
Prints a word set to standard output as default, otherwise to
~oc .
|
pt [Acceptors.ACCEPTOR_TYPE] |
Returns a prefix tree from a set of words.
|
R | |
range_fsa [Acceptors.ACCEPTOR_TYPE] |
Returns a range distinct acceptor from a set of words.
|
rename [Machines.MACHINE_TYPE] |
Renames the nodes of a machine.
|
rename_n [Machines.MACHINE_TYPE] | rename_n n m renames the nodes of a machine beginning with integer n .
|
report [Machines.MACHINE_TYPE] |
Prints to standard output a summary of the size of the machine
|
reverse [Machines.MACHINE_TYPE] |
Returns the reverse machine
|
S | |
st [Acceptors.ACCEPTOR_TYPE] |
Returns a suffix tree from a set of words.
|
star [Acceptors.ACCEPTOR_TYPE] |
Returns an acceptor which accepts words in the language formed by taking
the star closure of the language of the input fsa.
|
starts [Machines.MACHINE_TYPE] |
Returns the start states of the machine.
|
T | |
terminus [Edges.EDGE_TYPE] |
Returns the terminus of an edge.
|
to_dotfile [Machines.MACHINE_TYPE] | to_dotfile ?size ?rd ?shape ?fs path graphname fsm writes a string
representation of fsm that can be interpreted by AT&T's
Graphviz drawing program to a file.
|
to_dotstring [Machines.MACHINE_TYPE] | |
to_dotstring [Edges.EDGE_TYPE] |
This function returns a string representation of the edge that can be interpreted by AT&T's Graphviz drawing
program.
|
to_file [Machines.MACHINE_TYPE] | to_file filename fsm writes fsm to file graphname .
|
to_x [Symbols.SYMBOL_TYPE] |
Returns an element of type
x given a symbol.
|
transform [Acceptors.ACCEPTOR_TYPE] | transform beginning_nodes word returns the nodeset that can be reached
from beginning_nodes with word .
|
trim [Machines.MACHINE_TYPE] |
Returns a machine with no useless states.
|
U | |
union [Machines.MACHINE_TYPE] | union m1 m2 returns a machine which is the union of the two
machines.
|
W | |
wild [Symbols.SYMBOL_TYPE] |
The universal symbol.
|
wordSet_of_string [Acceptors.ACCEPTOR_TYPE] |
Returns a word set from a string of words.
|