Results 111 to 120 of about 63,385 (219)
Elementary Cellular Automata as Multiplicative Automata
Elementary cellular automata (ECA) are converted into multiplicative versions by using permuted n-dim Galois fields and octonion multiplication tables as binary pointers to each rule's Wolfram code truth table. This enables an extension of the binary ECA to complex numbers, identity solutions are found, produces a polynomial, and is implemented in Java.
openaire +2 more sources
Forecasting a Language Shift Based on Cellular Automata [PDF]
Language extinction as a consequence of language shifts is a widespread social phenomenon that affects several million people all over the world today.
Marcos Ruiz-Soler +5 more
core
Neutral Emergence and Coarse Graining Cellular Automata [PDF]
Emergent systems are often thought of as special, and are often linked to desirable properties like robustness, fault tolerance and adaptability. But, though not well understood, emergence is not a magical, unfathomable property.
Weeks, Andrew
core
Concurrency and automata on infinite sequences [PDF]
The paper is concerned with ways in which fair concurrency can be modeled using notations for omega-regular languages - languages containing infinite sequences, whose recognizers a.re modified forms of Buchi or Muller-McNaughton automata.
Park, David
core
Learning algorithms for the control of routing in integrated service communication networks [PDF]
There is a high degree of uncertainty regarding the nature of traffic on future integrated service networks. This uncertainty motivates the use of adaptive resource allocation policies that can take advantage of the statistical fluctuations in the ...
Reeve, Jonathan Mark
core
Sublinearly space bounded iterative arrays
Iterative arrays (IAs) are a, parallel computational model with a sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata.
B.S. Palano +5 more
core
Detection of Non-declared Capabilities of JavaCard Applications
At this paper authors describe the methodic of detecting non-declared capabilities of JavaCard software, which can disclose privacy of secret key.
Sergey Sergeevich Agafyin +2 more
doaj
A Cellular Automata Simulation of the 1990s Russian Housing Privatization Decision [PDF]
The study uses a computational approach to study the phenomenon of housing privatization in Russia in the 1990s. As part of the housing reform flats in multi-family buildings were offered to their residents free of payment.
Chokri Dridi, Maria Plotnikova
core
Peierls Bounds from Toom Contours. [PDF]
Swart JM, Szabó R, Toninelli C.
europepmc +1 more source
SVDHLA: symmetric variable depth hybrid learning automaton and its application. [PDF]
Nikhalat-Jahromi A +2 more
europepmc +1 more source

