Permutation Factorization on Star-Connected Networks of Binary Automata

DOI10.1137/0606052MaRDI QIDQ3686635zbMATH OpenOpenAlexFDO

Authors Maurice Tchuente

Publication date 1985

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0606052

zbMATH Keywords

binary automatastar-connected network

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Applications of graph theory to circuits and networks (94C15)

Cites work

• On the interconnection structure of cellular networks
• Parallel realization of permutations over trees
• Tables of large graphs with given degree and diameter

Cited in

(3)

• Complete simulation of automata networks
• ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
• On expansive and anti-expansive tree maps

This page was built for publication: Permutation Factorization on Star-Connected Networks of Binary Automata

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