Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Anna Nenca"'
Publikováno v:
PHYSICAL REVIEW E
We consider two-dimensional cellular automata with the von Neumann neighborhood that satisfy two proper-ties of interest from a modeling viewpoint: rotation symmetry (i.e., the local rule is invariant under rotation of the neighborhood by 90 degrees)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0066b063675511c7eb17986aadeb5844
https://hdl.handle.net/1854/LU-01GT90CA45J7KCCNY7R94G5KS7
https://hdl.handle.net/1854/LU-01GT90CA45J7KCCNY7R94G5KS7
Publikováno v:
Information Sciences. 577:599-621
We present a novel method to study two-dimensional rotation-symmetric number-conserving multi-state cellular automata with the von Neumann neighborhood with radius one. This method enables a succinct and easy enumeration in all cases examined so far
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b03d4cc9d0cc35f00acef48f91b90027
https://doi.org/10.1016/j.ins.2021.06.041
https://doi.org/10.1016/j.ins.2021.06.041
Publikováno v:
Theoretical Computer Science. 953:113795
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::610ded2445b6691c76dd3f89c54b4474
https://doi.org/10.1016/j.tcs.2023.113795
https://doi.org/10.1016/j.tcs.2023.113795
Publikováno v:
Information and Computation. 274:104534
We present a simple approach for finding all number-conserving two-dimensional cellular automata with the von Neumann neighborhood. We demonstrate the efficiency of this approach by enumerating and describing four special cases: totalistic, outer-tot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b37930d9812cd9485f1a2cdfceebe1ef
https://doi.org/10.1016/j.ic.2020.104534
https://doi.org/10.1016/j.ic.2020.104534
Publikováno v:
Information Processing Letters. 156:105918
A signed graph is a pair ( G , σ ) , where G = ( V ( G ) , E ( G ) ) is an undirected graph and σ : E ( G ) → { + , − } is a function which marks each edge with “+” or “−”. Two signed graphs are equivalent if one of them can be change
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf13b3593ee6639ad27d8321754dfcfd
https://doi.org/10.1016/j.ipl.2020.105918
https://doi.org/10.1016/j.ipl.2020.105918
Autor:
Anna Nenca
Publikováno v:
Discussiones Mathematicae Graph Theory. 42:799
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb37031d01b0865a52124dc0161e5f8d
https://doi.org/10.7151/dmgt.2307
https://doi.org/10.7151/dmgt.2307
Autor:
Janusz Dybizbański, Anna Nenca
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 1, Pp 211-223 (2019)
An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph. In this paper, we focus on oriented col- orings of Cartesian products
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6319e6795bc4f8238f098f4d1365253
https://doi.org/10.7151/dmgt.2074
https://doi.org/10.7151/dmgt.2074
Autor:
Janusz Dybizbański, Anna Nenca
Publikováno v:
Information Processing Letters. 112:113-117
By a coloring graph we mean an oriented graph H without self loops and with no arcs going in opposite directions. We say that the coloring graph H colors an oriented graph G=(V"G,A"G) if there is a homomorphism from G to H. In this paper we show that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::514e57b7ad427e97935c57d68a0ab4be
https://doi.org/10.1016/j.ipl.2011.10.019
https://doi.org/10.1016/j.ipl.2011.10.019
Autor:
Adam Dzedzej, Barbara Wolnik, Maciej Dziemiańczuk, Anna Nenca, Jan M Baetens, Bernard De Baets
Publikováno v:
Journal of Statistical Mechanics: Theory & Experiment; Jul2019, Vol. 2019 Issue 7, p1-1, 1p