On the number of fixed points of a Boolean transformation

MaRDI QIDQ2839547zbMATH OpenFDO

Authors Sergiu Rudeanu

Publication date 11 July 2013

Published in Analele Universității din Craiova. Seria Matematică Informatică (Search for Journal in Brave)

zbMATH Keywords

Boolean transformationfixed pointirredundant solution

Mathematics Subject Classification ID

Recommendations

• Existence and number of fixed points of Boolean transformations via the semi-tensor product method
• Boolean transformations with unique fixed points
• On the computation of fixed points in Boolean networks
• A note on the fixed point for the polynomials of a Boolean algebra with an operator of endomorphism
• Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions

Cited in

(3)

• Boolean transformations with unique fixed points
• Existence and number of fixed points of Boolean transformations via the semi-tensor product method
• An upper bound on the number of iterations for transforming a Boolean function of degree greater or equal than 4 to a function of degree 3

This page was built for publication: On the number of fixed points of a Boolean transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2839547)