A | |
| add_rule [Automaton] |
Add the given rule (
XXXXX -> A) to the automaton.
|
C | |
| create_dimacs [Print] |
Print the given forumla (dimacs, string list ~ conjunction (the list) of disjunctions (string)) into a file
|
D | |
| dimacs_of_formula [Formula] |
Convert a given formula into a string (dimacs format)
|
G | |
| get_all_unstables [Stable] |
Get all unstable rules (index) from the given automaton, for example: AAAAD -> A or AAAAA -> D.
|
I | |
| inv [Show_stable] |
Inverse the given formula (dimacs); positive values become negative, the negative ones, positive.
|
| is_rule [Automaton] |
Test if the automaton contains the given rule (as a list reversed; for example ADDAD =
[D; A; D; D; A])
|
| is_stable [Show_stable] |
Interprete the minisat's result.
|
| ix_to_rule [Automaton] |
Transform the given int (index) to a rule; for example:
26 -> 11010 -> DDADA
|
L | |
| latex_of_formula [Formula] |
Convert a given formula into a string (latex format).
|
N | |
| next_generation [Simulate] |
Calculate the next generation of the given generation (according to the given automaton).
|
P | |
| parse [Read] |
Read an automaton and a generation from the given file
|
S | |
| show_generation [Print] |
Print a string representation of the given generation
|
| show_stable [Show_stable] |
Calculate all stable generations.
|
| stables [Stable] |
Transform the given automaton into a formula to calculate all stable generations.
|
| string_of_formula [Formula] |
Convert a given formula into a string.
|
U | |
| update_fnc [Show_stable] |
Update .dimacs first line.
|