Computation of Boolean functions on networks of binary automata

DOI10.1016/0022-0000(83)90016-8zbMath0508.94025OpenAlexW1993608184MaRDI QIDQ1838457

Maurice Tchuente

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90016-8

zbMATH Keywords

underlying graphBoolean transformationtree-connected network

Mathematics Subject Classification ID

Related Items

Computation on binary tree-networks ⋮ ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK ⋮ Complete simulation of automata networks

Cites Work

• Parallel calculation of a linear mapping on a computer network
• Generating all linear transformations
• Indecomposable parallel maps in tessellation structures
• On the fast synchronization of tree connected networks
• Some regular state sets in the system of one-dimensional iterative automata
• Synthesis of one-dimensional binary cellular automata systems from composite local maps
• On the interconnection structure of cellular networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item