Periodicity in generations of automata-Reference-Cited by-同舟云学术

Periodicity in generations of automata

Published:1974-03 Issue:1 Volume:8 Page:15-32
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Case John

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01761704.pdf

Reference29 articles.

1. M. A. Arbib, Automata theory and development: Part I,J. Theoret. Biol. 14 (1967), 131–156.

2. M. A. Arbib, Self-reproducing automata—some implications for theoretical biology, inTowards a Theoretical Biology, II, C. H. Waddington, Ed., Aldine Publishing Company, Chicago, 1969, pp. 204–226.

3. M. A. Arbib,Theories of Abstract Automata, Prentice-Hall, Englewood Cliffs, N.J., 1969.

4. F. W. Baker andG. T. Herman, Simulation of organisms using a developmental model, Parts I and II,Int. J. Biomed. Comp., to appear.

5. E. R. Banks, Information processing and transmission in cellular automata, MAC TR-81, MIT, 1970.

Cited by 112 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Secretive interaction;Information and Computation;2024-10

2. On the amount of nonconstructivity in learning formal languages from text;Information and Computation;2021-12

3. Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes;Lecture Notes in Computer Science;2021

4. Towards a Map for Incremental Learning in the Limit from Positive and Negative Information;Lecture Notes in Computer Science;2021

5. Mapping Monotonic Restrictions in Inductive Inference;Lecture Notes in Computer Science;2021