Groups and Monoids of Cellular Automata - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2015

Groups and Monoids of Cellular Automata

Ville Salo
  • Function : Author
  • PersonId : 998313
Universidad de Chile = University of Chile [Santiago]

Abstract

We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal subshifts, countable subshifts and coded and synchronized systems. Both purely group-theoretic properties and issues of decidability are considered.

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
338243_1_En_3_Chapter.pdf (432.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01442480

Submitted on : Friday, January 20, 2017-4:09:35 PM

Last modification on : Thursday, August 10, 2023-11:08:04 AM

Long-term archiving on: Friday, April 21, 2017-4:08:57 PM

Download

Dates and versions

hal-01442480 , version 1 (20-01-2017)

Licence

Attribution

Identifiers

Cite

Ville Salo. Groups and Monoids of Cellular Automata. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.17-45, ⟨10.1007/978-3-662-47221-7_3⟩. ⟨hal-01442480⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC1 IFIP-LNCS-9099 IFIP-AUTOMATA
60 View
232 Download

Altmetric

Share

Gmail Facebook X LinkedIn More