dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorSchreiber, Michael
dc.date2016-10-26T17:49:19Z
dc.date2016-10-26T17:49:19Z
dc.date.accessioned2017-04-06T11:43:27Z
dc.date.available2017-04-06T11:43:27Z
dc.identifierhttp://acervodigital.unesp.br/handle/unesp/361500
dc.identifierhttp://objetoseducacionais2.mec.gov.br/handle/mec/6079
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/957782
dc.descriptionKnowledge about: Cellular Automata, Coding Theory, Combinatorics, Data Structures, Discrete Mathematics, Discrete Models and Representations of Numbers
dc.descriptionNeighboring tiles evolve according to elementary cellular automaton rules that differ by one bit if Gray ordering is selected. Compare the 256 results for all elementary rules obtained from selected initial conditions of width nine. The initial conditions can be selected by ordinary enumeration order or by Gray code order, in which neighboring initializations differ by exactly one bit
dc.descriptionComponente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
dc.relation187ElementaryCellularAutomatonRulesByGrayCode.nbp
dc.rightsDemonstration freeware using Mathematica Player
dc.subjectEducação Superior::Ciências Exatas e da Terra::Matemática::Matemática Aplicada
dc.subjectDiscrete Model
dc.subjectRepresentation of number
dc.subjectData structure
dc.subjectCellular automata
dc.subjectCoding theory
dc.subjectDiscrete mathematic
dc.subjectCombinatoric
dc.titleElementary cellular automaton rules by gray code
dc.typeOtro


Este ítem pertenece a la siguiente institución