Extracting Boolean rules from CA patterns

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 30, Issue 4, 2000, Pages 573-581

  Yang, Yingxu ^a   Billings, S A ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION;

BOOLEAN IDENTIFICATION; CELLULAR AUTOMATA; SPATIOTEMPORAL PATTERNS;

AUTOMATA THEORY;

EID: 0034247697     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.865174     Document Type: Article

References (20)

1. J. von Neumann, "The general logical theory of automata," in Cerebral Mechanisms in Behavior - The Hixon Symposium. New York: Wiley, 1951.
2. L. Brieger and E. Bonomi, "A stochastic cellular automaton simulation of the nonlinear diffusion equation," Phys. D, vol. 47, no. 1-2, pp. 159-168, 1992.
3. G. Hernandez and H. J. Herrann, "Cellular automata for elementary image enhancement," Graph. Models Image Process., vol. 58, no. 1, pp. 82-89, 1996.
4. S. Bhattachariee and S. Sinha, "Cellular automata based scheme for solution of Boolean equations," Proc. Inst. Elect. Eng. Comput. Digital Tech., vol. 143, no. 3, pp. 174-180, 1996.
5. S. Surka and K. P. Valavanis, "A cellular automata model for edge relaxation," J. Intell. Robot. Syst., vol. 4, no. 4, pp. 379-391, 1991.
6. W. Li, N. H. Packard, and C. G. Langton, "Transition phenomena in cellular automata rule space," in Cellular Automata: Theory and Experiment, H. Gutowitz, Ed. Cambridge, MA: MIT Press, 1991.
7. F. C. Richards, "Extracting cellular automaton rules directly from experimental data," Phys. D, vol. 45, pp. 189-202, 1990.
8. A. I. Adamatskii, "Complexity of identification of cellular automata," Autom. Remote Control, pt. 2, vol. 53, no. 9, pp. 1449-1458, 1992.
9. W. V. Quine, "A way to simplify truth functions," Amer. Math. Monthly, vol. 62, pp. 627-631, 1955.
10. E. J. McCluskey Jr., "Minimization of Boolean functions," Bell Syst. Tech. J., vol. 35, pp. 1417-1444, 1956.
11. S. C. Gupta, "A fast procedure for finding prime implicants of a Boolean function," Int. J. Electron., vol. 51, no. 5, pp. 701-709, 1981.
12. S. R. Perkins and T. Rhyne, "An algorithm for identifying and selecting the prime implicants of a multiple-output Boolean function," IEEE Trans. Computer-Aided Design, vol. 7, pp. 1215-1218, Nov. 1988.
13. P. P. Chu, "Applying neural networks to find the minimum cost coverage of a Boolean function," VLSI Design, vol. 3, no. 1, pp. 13-19, 1995.
14. S. Chattopadhyay, S. Roy, and P. P. Chaudhun, "KGPMIN: An efficient multilevel multioutput AND-OR-XOR minimizer," IEEE Trans. Computer-Aided Design, vol. 16, pp. 257-265, Mar. 1997.
15. B. H. Voorhees, Computational Analysis of One-dimensional Cellular Automata, ser. World Scientific Series on Nonlinear Science. Singapore: World Scientific, 1996.
16. S. A. Billings, S. Chen, and M. J. Korenberg, "Identification of MIMO nonlinear systems using a forward-regression orthogonal estimator," Int. J. Control, vol. 49, no. 6, pp. 2157-2189, 1989.
17. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. New York: Springer-Verlag, 1994.
18. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
19. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press, 1992.
20. A. J. Chipperfield and P. J. Fleming, "Genetic algorithms in control systems engineering," Control Comput., vol. 23, pp. 88-94, 1996.