Sequentializing cellular automata
Abstract 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 t...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Kari, Jarkko [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2019 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s) 2019 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Natural computing - Springer Netherlands, 2002, 19(2019), 4 vom: 01. Juni, Seite 759-772 |
|---|---|
| Übergeordnetes Werk: |
volume:19 ; year:2019 ; number:4 ; day:01 ; month:06 ; pages:759-772 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11047-019-09745-7 |
|---|
| Katalog-ID: |
OLC2120560811 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2120560811 | ||
| 003 | DE-627 | ||
| 005 | 20230504175946.0 | ||
| 007 | tu | ||
| 008 | 230504s2019 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11047-019-09745-7 |2 doi | |
| 035 | |a (DE-627)OLC2120560811 | ||
| 035 | |a (DE-He213)s11047-019-09745-7-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 570 |a 004 |q VZ |
| 084 | |a 12 |2 ssgn | ||
| 084 | |a 54.28$jNichtelektronische Datenverarbeitung |2 bkl | ||
| 084 | |a 54.72$jKünstliche Intelligenz |2 bkl | ||
| 100 | 1 | |a Kari, Jarkko |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Sequentializing cellular automata |
| 264 | 1 | |c 2019 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s) 2019 | ||
| 520 | |a Abstract 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. | ||
| 650 | 4 | |a Cellular automata | |
| 650 | 4 | |a Closing | |
| 650 | 4 | |a Sequentialization | |
| 700 | 1 | |a Salo, Ville |0 (orcid)0000-0002-2059-194X |4 aut | |
| 700 | 1 | |a Worsch, Thomas |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Natural computing |d Springer Netherlands, 2002 |g 19(2019), 4 vom: 01. Juni, Seite 759-772 |w (DE-627)36367487X |w (DE-600)2110258-2 |w (DE-576)9363674878 |x 1567-7818 |7 nnns |
| 773 | 1 | 8 | |g volume:19 |g year:2019 |g number:4 |g day:01 |g month:06 |g pages:759-772 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11047-019-09745-7 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 936 | b | k | |a 54.28$jNichtelektronische Datenverarbeitung |q VZ |0 106418858 |0 (DE-625)106418858 |
| 936 | b | k | |a 54.72$jKünstliche Intelligenz |q VZ |0 10641240X |0 (DE-625)10641240X |
| 951 | |a AR | ||
| 952 | |d 19 |j 2019 |e 4 |b 01 |c 06 |h 759-772 | ||
| author_variant |
j k jk v s vs t w tw |
|---|---|
| matchkey_str |
article:15677818:2019----::eunilznclu |
| hierarchy_sort_str |
2019 |
| bklnumber |
54.28$jNichtelektronische Datenverarbeitung 54.72$jKünstliche Intelligenz |
| publishDate |
2019 |
| allfields |
10.1007/s11047-019-09745-7 doi (DE-627)OLC2120560811 (DE-He213)s11047-019-09745-7-p DE-627 ger DE-627 rakwb eng 570 004 VZ 12 ssgn 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz bkl Kari, Jarkko verfasserin aut Sequentializing cellular automata 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2019 Abstract 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. Cellular automata Closing Sequentialization Salo, Ville (orcid)0000-0002-2059-194X aut Worsch, Thomas aut Enthalten in Natural computing Springer Netherlands, 2002 19(2019), 4 vom: 01. Juni, Seite 759-772 (DE-627)36367487X (DE-600)2110258-2 (DE-576)9363674878 1567-7818 nnns volume:19 year:2019 number:4 day:01 month:06 pages:759-772 https://doi.org/10.1007/s11047-019-09745-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.28$jNichtelektronische Datenverarbeitung VZ 106418858 (DE-625)106418858 54.72$jKünstliche Intelligenz VZ 10641240X (DE-625)10641240X AR 19 2019 4 01 06 759-772 |
| spelling |
10.1007/s11047-019-09745-7 doi (DE-627)OLC2120560811 (DE-He213)s11047-019-09745-7-p DE-627 ger DE-627 rakwb eng 570 004 VZ 12 ssgn 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz bkl Kari, Jarkko verfasserin aut Sequentializing cellular automata 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2019 Abstract 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. Cellular automata Closing Sequentialization Salo, Ville (orcid)0000-0002-2059-194X aut Worsch, Thomas aut Enthalten in Natural computing Springer Netherlands, 2002 19(2019), 4 vom: 01. Juni, Seite 759-772 (DE-627)36367487X (DE-600)2110258-2 (DE-576)9363674878 1567-7818 nnns volume:19 year:2019 number:4 day:01 month:06 pages:759-772 https://doi.org/10.1007/s11047-019-09745-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.28$jNichtelektronische Datenverarbeitung VZ 106418858 (DE-625)106418858 54.72$jKünstliche Intelligenz VZ 10641240X (DE-625)10641240X AR 19 2019 4 01 06 759-772 |
| allfields_unstemmed |
10.1007/s11047-019-09745-7 doi (DE-627)OLC2120560811 (DE-He213)s11047-019-09745-7-p DE-627 ger DE-627 rakwb eng 570 004 VZ 12 ssgn 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz bkl Kari, Jarkko verfasserin aut Sequentializing cellular automata 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2019 Abstract 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. Cellular automata Closing Sequentialization Salo, Ville (orcid)0000-0002-2059-194X aut Worsch, Thomas aut Enthalten in Natural computing Springer Netherlands, 2002 19(2019), 4 vom: 01. Juni, Seite 759-772 (DE-627)36367487X (DE-600)2110258-2 (DE-576)9363674878 1567-7818 nnns volume:19 year:2019 number:4 day:01 month:06 pages:759-772 https://doi.org/10.1007/s11047-019-09745-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.28$jNichtelektronische Datenverarbeitung VZ 106418858 (DE-625)106418858 54.72$jKünstliche Intelligenz VZ 10641240X (DE-625)10641240X AR 19 2019 4 01 06 759-772 |
| allfieldsGer |
10.1007/s11047-019-09745-7 doi (DE-627)OLC2120560811 (DE-He213)s11047-019-09745-7-p DE-627 ger DE-627 rakwb eng 570 004 VZ 12 ssgn 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz bkl Kari, Jarkko verfasserin aut Sequentializing cellular automata 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2019 Abstract 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. Cellular automata Closing Sequentialization Salo, Ville (orcid)0000-0002-2059-194X aut Worsch, Thomas aut Enthalten in Natural computing Springer Netherlands, 2002 19(2019), 4 vom: 01. Juni, Seite 759-772 (DE-627)36367487X (DE-600)2110258-2 (DE-576)9363674878 1567-7818 nnns volume:19 year:2019 number:4 day:01 month:06 pages:759-772 https://doi.org/10.1007/s11047-019-09745-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.28$jNichtelektronische Datenverarbeitung VZ 106418858 (DE-625)106418858 54.72$jKünstliche Intelligenz VZ 10641240X (DE-625)10641240X AR 19 2019 4 01 06 759-772 |
| allfieldsSound |
10.1007/s11047-019-09745-7 doi (DE-627)OLC2120560811 (DE-He213)s11047-019-09745-7-p DE-627 ger DE-627 rakwb eng 570 004 VZ 12 ssgn 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz bkl Kari, Jarkko verfasserin aut Sequentializing cellular automata 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2019 Abstract 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. Cellular automata Closing Sequentialization Salo, Ville (orcid)0000-0002-2059-194X aut Worsch, Thomas aut Enthalten in Natural computing Springer Netherlands, 2002 19(2019), 4 vom: 01. Juni, Seite 759-772 (DE-627)36367487X (DE-600)2110258-2 (DE-576)9363674878 1567-7818 nnns volume:19 year:2019 number:4 day:01 month:06 pages:759-772 https://doi.org/10.1007/s11047-019-09745-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT 54.28$jNichtelektronische Datenverarbeitung VZ 106418858 (DE-625)106418858 54.72$jKünstliche Intelligenz VZ 10641240X (DE-625)10641240X AR 19 2019 4 01 06 759-772 |
| language |
English |
| source |
Enthalten in Natural computing 19(2019), 4 vom: 01. Juni, Seite 759-772 volume:19 year:2019 number:4 day:01 month:06 pages:759-772 |
| sourceStr |
Enthalten in Natural computing 19(2019), 4 vom: 01. Juni, Seite 759-772 volume:19 year:2019 number:4 day:01 month:06 pages:759-772 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Cellular automata Closing Sequentialization |
| dewey-raw |
570 |
| isfreeaccess_bool |
false |
| container_title |
Natural computing |
| authorswithroles_txt_mv |
Kari, Jarkko @@aut@@ Salo, Ville @@aut@@ Worsch, Thomas @@aut@@ |
| publishDateDaySort_date |
2019-06-01T00:00:00Z |
| hierarchy_top_id |
36367487X |
| dewey-sort |
3570 |
| id |
OLC2120560811 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2120560811</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504175946.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230504s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11047-019-09745-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2120560811</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11047-019-09745-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">12</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.28$jNichtelektronische Datenverarbeitung</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72$jKünstliche Intelligenz</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kari, Jarkko</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sequentializing cellular automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract 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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cellular automata</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Closing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequentialization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Salo, Ville</subfield><subfield code="0">(orcid)0000-0002-2059-194X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Worsch, Thomas</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Natural computing</subfield><subfield code="d">Springer Netherlands, 2002</subfield><subfield code="g">19(2019), 4 vom: 01. Juni, Seite 759-772</subfield><subfield code="w">(DE-627)36367487X</subfield><subfield code="w">(DE-600)2110258-2</subfield><subfield code="w">(DE-576)9363674878</subfield><subfield code="x">1567-7818</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:19</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:4</subfield><subfield code="g">day:01</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:759-772</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11047-019-09745-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.28$jNichtelektronische Datenverarbeitung</subfield><subfield code="q">VZ</subfield><subfield code="0">106418858</subfield><subfield code="0">(DE-625)106418858</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72$jKünstliche Intelligenz</subfield><subfield code="q">VZ</subfield><subfield code="0">10641240X</subfield><subfield code="0">(DE-625)10641240X</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">19</subfield><subfield code="j">2019</subfield><subfield code="e">4</subfield><subfield code="b">01</subfield><subfield code="c">06</subfield><subfield code="h">759-772</subfield></datafield></record></collection>
|
| author |
Kari, Jarkko |
| spellingShingle |
Kari, Jarkko ddc 570 ssgn 12 bkl 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz misc Cellular automata misc Closing misc Sequentialization Sequentializing cellular automata |
| authorStr |
Kari, Jarkko |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)36367487X |
| format |
Article |
| dewey-ones |
570 - Life sciences; biology 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1567-7818 |
| topic_title |
570 004 VZ 12 ssgn 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz bkl Sequentializing cellular automata Cellular automata Closing Sequentialization |
| topic |
ddc 570 ssgn 12 bkl 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz misc Cellular automata misc Closing misc Sequentialization |
| topic_unstemmed |
ddc 570 ssgn 12 bkl 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz misc Cellular automata misc Closing misc Sequentialization |
| topic_browse |
ddc 570 ssgn 12 bkl 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz misc Cellular automata misc Closing misc Sequentialization |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Natural computing |
| hierarchy_parent_id |
36367487X |
| dewey-tens |
570 - Life sciences; biology 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Natural computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)36367487X (DE-600)2110258-2 (DE-576)9363674878 |
| title |
Sequentializing cellular automata |
| ctrlnum |
(DE-627)OLC2120560811 (DE-He213)s11047-019-09745-7-p |
| title_full |
Sequentializing cellular automata |
| author_sort |
Kari, Jarkko |
| journal |
Natural computing |
| journalStr |
Natural computing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science 000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2019 |
| contenttype_str_mv |
txt |
| container_start_page |
759 |
| author_browse |
Kari, Jarkko Salo, Ville Worsch, Thomas |
| container_volume |
19 |
| class |
570 004 VZ 12 ssgn 54.28$jNichtelektronische Datenverarbeitung bkl 54.72$jKünstliche Intelligenz bkl |
| format_se |
Aufsätze |
| author-letter |
Kari, Jarkko |
| doi_str_mv |
10.1007/s11047-019-09745-7 |
| normlink |
(ORCID)0000-0002-2059-194X 106418858 10641240X |
| normlink_prefix_str_mv |
(orcid)0000-0002-2059-194X 106418858 (DE-625)106418858 10641240X (DE-625)10641240X |
| dewey-full |
570 004 |
| title_sort |
sequentializing cellular automata |
| title_auth |
Sequentializing cellular automata |
| abstract |
Abstract 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. © The Author(s) 2019 |
| abstractGer |
Abstract 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. © The Author(s) 2019 |
| abstract_unstemmed |
Abstract 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. © The Author(s) 2019 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT |
| container_issue |
4 |
| title_short |
Sequentializing cellular automata |
| url |
https://doi.org/10.1007/s11047-019-09745-7 |
| remote_bool |
false |
| author2 |
Salo, Ville Worsch, Thomas |
| author2Str |
Salo, Ville Worsch, Thomas |
| ppnlink |
36367487X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11047-019-09745-7 |
| up_date |
2024-07-04T04:28:30.845Z |
| _version_ |
1803621300534509568 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2120560811</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504175946.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230504s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11047-019-09745-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2120560811</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11047-019-09745-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">12</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.28$jNichtelektronische Datenverarbeitung</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72$jKünstliche Intelligenz</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kari, Jarkko</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sequentializing cellular automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract 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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cellular automata</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Closing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequentialization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Salo, Ville</subfield><subfield code="0">(orcid)0000-0002-2059-194X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Worsch, Thomas</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Natural computing</subfield><subfield code="d">Springer Netherlands, 2002</subfield><subfield code="g">19(2019), 4 vom: 01. Juni, Seite 759-772</subfield><subfield code="w">(DE-627)36367487X</subfield><subfield code="w">(DE-600)2110258-2</subfield><subfield code="w">(DE-576)9363674878</subfield><subfield code="x">1567-7818</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:19</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:4</subfield><subfield code="g">day:01</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:759-772</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11047-019-09745-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.28$jNichtelektronische Datenverarbeitung</subfield><subfield code="q">VZ</subfield><subfield code="0">106418858</subfield><subfield code="0">(DE-625)106418858</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72$jKünstliche Intelligenz</subfield><subfield code="q">VZ</subfield><subfield code="0">10641240X</subfield><subfield code="0">(DE-625)10641240X</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">19</subfield><subfield code="j">2019</subfield><subfield code="e">4</subfield><subfield code="b">01</subfield><subfield code="c">06</subfield><subfield code="h">759-772</subfield></datafield></record></collection>
|
| score |
7.400943 |