Sukanya Mukherjee

Institute of Engineering & Management | IEM · Department of Computer Science & Engineering

This work proposes reversible finite cellular automaton (CA) as a natural clustering tool, where closeness between two configurations is measured as whether they are reachable from each other. As any finite reversible CA distributes its configurations into a number of cyclic spaces, so, two configurations belonging to the same cycle are close to ea...

This paper introduces a cycle-based clustering technique using the cyclic spaces of reversible cellular automata (CAs). Traditionally, a cluster consists of close objects, which in the case of CAs necessarily means that the objects belong to the same cycle; that is, they are reachable from each other. Each of the cyclic spaces of a cellular automat...

This paper reports a stochastic method of synthesizing three-neighborhood two-state nonlinear non-uniform reversible cellular automata (CAs) having large cycle(s). To develop this method, we propose a parameter which measures the dependency of each cell on its neighbors. Using this parameter, we classify the possible rules of reversible CAs into fo...

This work proposes cycle based clustering technique using reversible cellular automata (CAs) where ‘closeness’ among objects is represented as objects belonging to the same cycle, that is reachable from each other. The properties of such CAs are exploited for grouping the objects with minimum intra-cluster distance while ensuring that limited numbe...

This paper deals with the CREP (Configuration REachability Problem) for non-uniform cellular automata (CAs). The cells of non-uniform CAs, we have considered here, can use different Wolfram’s rules to generate their next states. We report an algorithm which decides whether or not a configuration of a given (non-uniform) cellular automaton is reacha...

This paper deals with the CREP (Configuration REachability Problem) for non-uniform cellular automata (CAs). The cells of non-uniform CAs, we have considered here, can use different Wolfram's rules to generate their next states. We report an algorithm which decides whether or not a configuration of a given (non-uniform) cellular automaton is reacha...

The single attractor cellular automata (SACA) is of prime interest in devising schemes for different applications specially in authentication and cryptography. The synthesis of SACA in linear/additive domain has been proposed in literature. This work reports characterization of such a special class of CA beyond linear domain. The characterization i...

The special class of irreversible cellular automaton (CA) with multiple attractors is of immense interest to the CA researchers. Characterization of such a CA is the necessity to devise CA based solutions for diverse applications. This work explores the essential properties of CA attractors towards characterization of the 1-dimensional cellular aut...

This work proposes characterization of single-length cycle cellular automata (CA) attractors with the target to model this class of CA for designing efficient pattern recognizer. Identification of essential properties of a CA while forming multi-length cycles provides the basis of such characterization. A scheme has been developed that synthesizes...