most citedAn equivalence preserving transformation from the Fibonacci to the Galois NLFSRs

7 citations · 9 across the 4 of their papers we have counts for

collaborators
Showing q-bio.MNShow all

1 paper · 1 filter

q-bio.MN2009★ 2 cited

A SAT-Based Algorithm for Computing Attractors in Synchronous Boolean Networks

Elena Dubrova, Maxim Teslenko

This paper addresses the problem of finding cycles in the state transition graphs of synchronous Boolean networks. Synchronous Boolean networks are a class of deterministic finite…