This article presents a formal framework for modeling computational genetic regulatory networks as automata, with multi-threshold protein concentration and combinatorial logical gene-protein interactions. By computing the intersection of the languages generated by these automata we obtain the complete set of pathways in a gene network. We illustrate the effectiveness of our framework in the modeling of (i) morphogenesis in Arabidopsis and (ii) regulation in phage λ.