Problem solving on one-bit-communication cellular automata

DOI10.1007/978-3-642-12203-3_6MaRDI QIDQ3055549zbMATH OpenOpenAlexFDO

Authors Hiroshi Umeo

Publication date 8 November 2010

Published in Understanding Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12203-3_6

zbMATH Keywords

problem solving

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 5190413
• scientific article; zbMATH DE number 2153022
• 1-bit inter-cell communication cellular algorithms.
• scientific article; zbMATH DE number 2009869
• On one-way one-bit O (one)-message cellular automata

Cited in

(8)

• 1-bit inter-cell communication cellular algorithms.
• Solving the parity problem in one-dimensional cellular automata
• Time-optimum smaller-state synchronizers for cellular automata
• scientific article; zbMATH DE number 5190413 (Why is no real title available?)
• scientific article; zbMATH DE number 2153022 (Why is no real title available?)
• Real-Time Prime Generators Implemented on Small-State Cellular Automata
• scientific article; zbMATH DE number 7339755 (Why is no real title available?)
• Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton

This page was built for publication: Problem solving on one-bit-communication cellular automata

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