A4 Refereed article in a conference publication

Groups and Monoids of Cellular Automata



Authors: Salo V

Editors: Kari J.

Conference name: International Workshop on Cellular Automata and Discrete Complex Systems

Publisher: SPRINGER-VERLAG NEW YORK, MS INGRID CUNNINGHAM, 175 FIFTH AVE, NEW YORK, NY 10010 USA

Publishing place: Berlin

Publication year: 2015

Book title : Cellular Automata and Discrete Complex Systems. AUTOMATA 2015

Journal name in source: CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS, AUTOMATA 2015

Journal acronym: LECT NOTES COMPUT SC

Series title: Lecture Notes in Computer Science

Volume: 9099

First page : 17

Last page: 45

Number of pages: 29

ISBN: 978-3-662-47220-0

eISBN: 978-3-662-47221-7

ISSN: 0302-9743

DOI: https://doi.org/10.1007/978-3-662-47221-7_3(external)


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.

Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.


Last updated on 2024-26-11 at 23:43