65void named_dfaedges_print(
dequeue_gen* theedges,
dfa* A, FILE* out);
69void dgraphedges_print(
dequeue_gen* theedges, FILE* out);
71void nfa_print(
nfa* A, FILE* out);
73void dfa_print(
dfa* A, FILE* out);
75void dgraph_print(
dgraph* g, FILE* out);
77void cayley_print(
morphism* mor, FILE* out);
79void cayley_left_print(
morphism* mor, FILE* out);
90void view_dgraph(
dgraph* g);
96void view_image(
const char* filename);
102void latex_init(
void);
104void latex_print_nfa(
nfa* A, FILE* out);
106void latex_print_dfa(
dfa* A, FILE* out);
108void latex_print_cayley(
morphism* M, FILE* out);
110void latex_print_lcayley(
morphism* M, FILE* out);
Macros and functions to help memory allocation.
Implementation of morphisms into finite monoids.
Patterns equations for DFAs.
Type used to represent a generic dequeue.
Definition type_dequeue_gen.h:32
Type used to represent a dequeue of unsigned integers.
Definition type_dequeue.h:26
Type used to represent a complete DFA.
Definition nfa.h:61
Type used to represent a complete deterministic directed labeled graph.
Definition graphs.h:73
The type used to represent a morphism into a finite monoid.
Definition monoid.h:91
Type used to represent a multi-edge in a graph.
Definition printing.h:30
bool eps
Epsilon transition.
Definition printing.h:32
dequeue * lab
Sorted list of labels.
Definition printing.h:33
dequeue * lab_i
Sorted list of inverse labels.
Definition printing.h:34
uint in
Initial state of the edge.
Definition printing.h:31
uint out
Final state of the edge.
Definition printing.h:35
Type used to represent a NFA.
Definition nfa.h:43
Implementation of dequeues of unsigned integers.