Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications
Reference18 articles.
1. Berlekamp ER (1967) Factoring polynomials over finite fields. Bell Syst Tech J 46(8):1853–1859
2. Cattaneo G, Finelli M, Margara L (2000) Investigating topological Chaos by elementary cellular automata dynamics. Theor Comput Sci 244(1–2):219–241
3. Cattaneo G, Dennunzio A, Margara L (2004) Solution of some conjectures about topological properties of linear cellular automata. Theor Comput Sci 325(2):249–271
4. Chassé G (1990) Some remarks on a LFSR ”disturbed” by other sequences. In: EUROCODE ’90, international symposium on coding theory and applications, Udine, Nov 5–9, 1990, Proceedings, pp 215–221
5. Dennunzio A, Formenti E, Weiss M (2014) Multidimensional cellular automata: closing property, quasi-expansivity, and (un) decidability issues. Theor Comput Sci 516:40–59
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献