Computation of Boolean functions on networks of binary automata

DOI10.1016/0022-0000(83)90016-8zbMATH Open0508.94025OpenAlexW1993608184MaRDI QIDQ1838457FDOQ1838457

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

Cites Work

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

Cited In (3)

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

This page was built for publication: Computation of Boolean functions on networks of binary automata

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