scientific article; zbMATH DE number 4061156

MaRDI QIDQ3795615zbMATH OpenFDO

Authors A. S. Podkolzin

Publication date 1987

zbMATH Keywords

Boolean functionscellular automatahomogeneous structurestemporal complexity

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 4176981
• scientific article; zbMATH DE number 3957104
• On the comparison of complexity of two ways of realization of some linear Boolean functions
• On the realisation of Boolean functions by informational graphs
• Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states

Cited in

(3)

• Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states
• Some criteria for bounds on homogeneous nets
• Quasiuniversal Boolean automaton with four constant states

This page was built for publication:

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