Groups and Monoids of Cellular Automata

dc.contributor.authorSalo V
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id18196569
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/18196569
dc.date.accessioned2025-08-28T01:05:45Z
dc.date.available2025-08-28T01:05:45Z
dc.description.abstractWe 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.
dc.format.pagerange17
dc.format.pagerange45
dc.identifier.eisbn978-3-662-47221-7
dc.identifier.isbn978-3-662-47220-0
dc.identifier.issn0302-9743
dc.identifier.olddbid207004
dc.identifier.oldhandle10024/190031
dc.identifier.urihttps://www.utupub.fi/handle/11111/49885
dc.identifier.urnURN:NBN:fi-fe2021042716188
dc.language.isoen
dc.okm.affiliatedauthorSalo, Ville
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline113 Computer and information sciencesen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.discipline113 Tietojenkäsittely ja informaatiotieteetfi_FI
dc.okm.internationalcopublicationinternational co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA4 Conference Article
dc.publisher.countryGermanyen_GB
dc.publisher.countrySaksafi_FI
dc.publisher.country-codeDE
dc.publisher.placeBerlin
dc.relation.conferenceInternational Workshop on Cellular Automata and Discrete Complex Systems
dc.relation.doi10.1007/978-3-662-47221-7_3
dc.relation.ispartofseriesLecture Notes in Computer Science
dc.relation.volume9099
dc.source.identifierhttps://www.utupub.fi/handle/10024/190031
dc.titleGroups and Monoids of Cellular Automata
dc.title.bookCellular Automata and Discrete Complex Systems. AUTOMATA 2015
dc.year.issued2015

Tiedostot

Näytetään 1 - 1 / 1
Ladataan...
Name:
InvitedShortSent.pdf
Size:
417.43 KB
Format:
Adobe Portable Document Format