Computation on binary tree-networks

DOI10.1016/0166-218X(86)90033-8zbMath0602.68039MaRDI QIDQ1082077

Maurice Tchuente

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Boolean functionscomputabilityfinite automata network

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Modal functions for concise definition of state machines and products ⋮ ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK ⋮ Complete simulation of automata networks ⋮ On simulation in automata networks

Cites Work

• Unnamed Item
• Computation of Boolean functions on networks of binary automata
• `` Strong NP-Completeness Results

This page was built for publication: Computation on binary tree-networks