Complexity of sequential realization of cellular automata maps

MaRDI QIDQ1914119zbMATH OpenFDO

Authors A. I. Adamatskij

Publication date 6 June 1996

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

finite asynchronous cellular automaton

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Parallel algorithms in computer science (68W10)

Recommendations

• On the reduction of computational complexity of cellular automata
• Complexity of identification of cellular automata
• Computing issues of asynchronous CA
• Computations on one-dimensional cellular automata
• scientific article; zbMATH DE number 1985715

Cited in

(5)

• Complexity of identification of cellular automata
• Analytic description and quadratic optimization of binary multidimensional nonlinear sequential cell machines
• Complexity analysis of time series generated by elementary cellular automata
• On the reduction of computational complexity of cellular automata
• scientific article; zbMATH DE number 4131676 (Why is no real title available?)

This page was built for publication: Complexity of sequential realization of cellular automata maps

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