DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hunziker, M | - |
dc.contributor.author | Machiavelo, A | - |
dc.contributor.author | Park, H | - |
dc.date.accessioned | 2016-03-31T12:24:50Z | - |
dc.date.available | 2016-03-31T12:24:50Z | - |
dc.date.created | 2009-02-28 | - |
dc.date.issued | 2004-06-14 | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.other | 2004-OAK-0000004318 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/17885 | - |
dc.description.abstract | Using number theory on function fields and algebraic number fields, we prove results about Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional additive cellular automata on finite square grids. For example, we show that there are infinitely many primitive irreversible additive cellular automata on square grids when the base field has order two or three. (C) 2004 Elsevier B.V. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.relation.isPartOf | THEORETICAL COMPUTER SCIENCE | - |
dc.title | Chebyshev polynomials over finite fields and reversibility of sigma-automata on square grids | - |
dc.type | Article | - |
dc.contributor.college | 수학과 | - |
dc.identifier.doi | 10.1016/J.TCS.2004.03.031 | - |
dc.author.google | Hunziker, M | - |
dc.author.google | Machiavelo, A | - |
dc.author.google | Park, H | - |
dc.relation.volume | 320 | - |
dc.relation.issue | 2-3 | - |
dc.relation.startpage | 465 | - |
dc.relation.lastpage | 483 | - |
dc.contributor.id | 10091171 | - |
dc.relation.journal | THEORETICAL COMPUTER SCIENCE | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | THEORETICAL COMPUTER SCIENCE, v.320, no.2-3, pp.465 - 483 | - |
dc.identifier.wosid | 000221936000017 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 483 | - |
dc.citation.number | 2-3 | - |
dc.citation.startPage | 465 | - |
dc.citation.title | THEORETICAL COMPUTER SCIENCE | - |
dc.citation.volume | 320 | - |
dc.contributor.affiliatedAuthor | Park, H | - |
dc.identifier.scopusid | 2-s2.0-2442695708 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 14 | - |
dc.description.scptc | 15 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | additive cellular automata | - |
dc.subject.keywordAuthor | Chebyshev polynomials | - |
dc.subject.keywordAuthor | finite fields | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.