Skip to main content


Fig. 1 | Algorithms for Molecular Biology

Fig. 1

From: Identification of bifurcation transitions in biological regulatory networks using Answer-Set Programming

Fig. 1

An example of automata network (AN). Automata are represented by labelled boxes, and local states by circles where ticks are their identifier within the automaton—for instance, the local state \(a_0\) is the circle ticked 0 in the box a. A transition is a directed edge between two local states within the same automaton. It can be labelled with a set of local states of other automata. Grayed local states stand for the global state \(\langle a_0, b_0, c_0 \rangle\)

Back to article page