Computation on binary tree-networks

DOI10.1016/0166-218X(86)90033-8MaRDI QIDQ1082077zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4078823
• scientific article; zbMATH DE number 3874616
• scientific article; zbMATH DE number 4108159
• scientific article; zbMATH DE number 1355187
• Computing Boolean functions on anonymous networks

Cites work

• scientific article; zbMATH DE number 3099421 (Why is no real title available?)
• Computation of Boolean functions on networks of binary automata
• `` Strong NP-Completeness Results

Cited in

(8)

• On simulation in automata networks
• scientific article; zbMATH DE number 4078823 (Why is no real title available?)
• Complete simulation of automata networks
• scientific article; zbMATH DE number 2186525 (Why is no real title available?)
• ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
• Sur quelques classes d’applications de $N^2$ dans les ensembles finis
• Modal functions for concise definition of state machines and products

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

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