Advanced search
Publication Cover
International Journal of Parallel, Emergent and Distributed Systems Volume 39, 2024 - Issue 2
Submit an article Journal homepage
17
Views
0
CrossRef citations to date
0
Altmetric
Research Article

A strongly universal cellular automaton on the heptagrid with five states, but with not rotation invariance of the rules

Maurice MargensternUniversité de Lorraine, FranceCorrespondence[email protected]
Pages 152-182 | Received 12 Jun 2023, Accepted 03 Jul 2023, Published online: 05 Sep 2023

References

  • Margenstern M. New tools for cellular automata in the hyperbolic plane. J Univers Comput Sci. 2000;6(12):1226–1252. doi:10.3217/jucs-006-12-1226
  • Margenstern M. Cellular automata in hyperbolic spaces: theory. Vol. 1, Collection. In: Adamatzky A, editor. Advances in unconventional computing and cellular automata, Philadelphia: Old City Publishing; 2007. 422p.
  • Margenstern M. A strongly universal cellular automaton on the heptagrid with six states. 2023. 35p. arXiv:2304.13575v1.
  • Margenstern M. A strongly universal cellular automaton on the heptagrid with seven states. 2021. 43p. arXiv:2102.04292v1.
  • Herrmann F, Margenstern M. A universal cellular automaton in the hyperbolic plane. Theor Comput Sci. 2003;296:327–364. doi: 10.1016/S0304-3975(02)00660-6
  • Margenstern M, Song Y. A new universal cellular automaton on the pentagrid. Parallel Process Lett. 2009;19(2):227–246. doi: 10.1142/S0129626409000195
  • Margenstern M. A weakly universal cellular automaton in the pentagrid with five states. In: Calude CS, et al. editors. Gruska's Festschrift; 2014. p. 99–113. (Lecture notes in computer science; 8808).
  • Margenstern M. A weakly universal cellular automaton in the heptagrid with three states. 2014. 27p. arXiv:1410.1864v1.
  • Margenstern M. A weakly universal cellular automaton in the heptagrid of the hyperbolic plane. Complex Syst. 2018;27(4):315–354. doi: 10.25088/ComplexSystems
  • Margenstern M. An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the Pentagrid. In: JAC2010 Proceedings; Turku, Finland: Turku Center for Computer Science; 2010. p. 168–179.
  • Minsky ML. Computation: finite and infinite machines. Englewood Cliffs (NJ): Prentice-Hall; 1967.
  • Stewart I. A subway named turing. In: Mathematical recreations in scientific American; 1994. p. 90–92.
  • Margenstern M. A weakly universal weighted cellular automaton on the heptagrid with 6 states. 2023. 35p. arXiv:2301.10691v2.
  • Margenstern M. A strongly universal cellular automaton on the heptagrid with seven states, new proof. 2023. 33p. arXiv:2301.10691v1.
  • Margenstern M. A strongly universal cellular automaton on the heptagrid with five states, but with not rotation invariance of the rules. 2023. 40p. arXiv:2306.06728v2.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.