Sequentializing cellular automata
| dc.contributor.author | Jarkko Kari | |
| dc.contributor.author | Ville Salo | |
| dc.contributor.author | Thomas Worsch | |
| dc.contributor.organization | fi=matematiikka|en=Mathematics| | |
| dc.contributor.organization-code | 1.2.246.10.2458963.20.41687507875 | |
| dc.converis.publication-id | 40800741 | |
| dc.converis.url | https://research.utu.fi/converis/portal/Publication/40800741 | |
| dc.date.accessioned | 2022-10-27T12:14:50Z | |
| dc.date.available | 2022-10-27T12:14:50Z | |
| dc.description.abstract | <p>We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single sweep of a bijective rule from left to right over an infinite tape. Such cellular automata are necessarily left-closing, and they move at least as much information to the left as they move information to the right.<br /></p> | |
| dc.identifier.eissn | 1572-9796 | |
| dc.identifier.jour-issn | 1567-7818 | |
| dc.identifier.olddbid | 174194 | |
| dc.identifier.oldhandle | 10024/157288 | |
| dc.identifier.uri | https://www.utupub.fi/handle/11111/33915 | |
| dc.identifier.urn | URN:NBN:fi-fe2021042822784 | |
| dc.language.iso | en | |
| dc.okm.affiliatedauthor | Kari, Jarkko | |
| dc.okm.affiliatedauthor | Salo, Ville | |
| dc.okm.discipline | 111 Mathematics | en_GB |
| dc.okm.discipline | 113 Computer and information sciences | en_GB |
| dc.okm.discipline | 111 Matematiikka | fi_FI |
| dc.okm.discipline | 113 Tietojenkäsittely ja informaatiotieteet | fi_FI |
| dc.okm.internationalcopublication | international co-publication | |
| dc.okm.internationality | International publication | |
| dc.okm.type | A1 ScientificArticle | |
| dc.publisher | Springer | |
| dc.publisher.country | Netherlands | en_GB |
| dc.publisher.country | Alankomaat | fi_FI |
| dc.publisher.country-code | NL | |
| dc.relation.doi | 10.1007/s11047-019-09745-7 | |
| dc.relation.ispartofjournal | Natural Computing | |
| dc.source.identifier | https://www.utupub.fi/handle/10024/157288 | |
| dc.title | Sequentializing cellular automata | |
| dc.year.issued | 2019 |
Tiedostot
1 - 1 / 1
Ladataan...
- Name:
- 10.1007_s11047-019-09745-7.pdf
- Size:
- 597 KB
- Format:
- Adobe Portable Document Format
- Description:
- Publisher´s PDF