Characterization of Single Cycle CA and its Application in Pattern Classification

DOI10.1016/j.entcs.2009.09.021zbMath1338.68178OpenAlexW2003566819MaRDI QIDQ2811960

Nazma N. Naskar, Sukanya Mukherjee, Sukanta Das, Biplab Sikdar

Publication date: 9 June 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.09.021

zbMATH Keywords

cellular automataattractorpattern classifierreachability treepseudo-exhaustive bit

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80)

Related Items

Scalability of Non-uniform Cellular Automata Having only Point State Attractors ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Unnamed Item

Cites Work

• Algebraic properties of cellular automata
• Random sequence generation by cellular automata
• Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata
• Statistical mechanics of cellular automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• A Cellular Automaton Model for an Immune-Derived Search Algorithm
• Characterization of Reachable/Nonreachable Cellular Automata States
• Simple self-reproducing universal automata
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item