Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference23 articles.
1. The general topology of dynamical systems;Akin,1993
2. A theory of complexity for continuous time systems;Ben-Hur;J. Complexity,2002
3. Universality in elementary Cellular Automata;Cook;Complex Syst.,2004
4. B. Durand, E. Formenti, G. Varouchas, On undecidability of equicontinuity classification for cellular automata, Discrete models for complex systems, DMCS’03 (Lyon), in: Discrete Math. Theor. Comput. Sci. Proc., AB, Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2003, pp. 117–127.
5. J.C. Delvenne, P. Kůrka, V. Blondel, Decidability and universality in symbolic dynamical systems, Machines, computations, and universality, Lecture Notes in Computer Science, vol. 3354, Springer, Berlin, 2005, pp. 104–115.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献