Related papers: Basic properties for sand automata
We initiate the study of pseudofiniteness in continuous logic. We introduce a related concept, namely that of pseudocompactness, and investigate the relationship between the two concepts. We establish some basic properties of…
The ideas about decision making under ignorance in economics are combined with the ideas about uncertainty representation in computer science. The combination sheds new light on the question of how artificial agents can act in a dynamically…
When submitted to the repeated passages of vehicles unpaved roads made of sand or gravel can develop a ripply pattern known as washboard or corrugated road. We propose a stability analysis based on experimental measurements of the force…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata and then in the general field of any computable function f…
We present a sandpile model, in which the instability of a site is determined also by the variables in a neighbourhood. This is a modification of the Abelian Sandpile Model, in which abelianity is preserved: it shares several mathematical…
This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain…
In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.
We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift-commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the…
The paper studies some important properties of the asynchronous (=timed) automata: the delay-insensitivity, the hazard-freedom, the semi-modularity and the technical condition of good running. Time is discrete.
We cast new light on the existing models of one-way deterministic topological automata by introducing a fresh but general, convenient model, in which, as each input symbol is read, an interior system of an automaton, known as a…
The Besicovitch pseudodistance measures the relative size of the set of points where two functions take different values; the quotient space modulo the induced equivalence relation is endowed with a natural metric. We study the behavior of…
Broadbent and G\"oller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by epsilon-free second-order pushdown automata. We add a few remarks concerning the used proof technique, called Defender's…
By using some tools of analysis, we establish some analytical properties such as monotonicity and inequalities involving the hyperbolic sine integral function. As applications of some of the established properties, we obtain some rational…
In this paper, we look at the following question. We consider cellular automata in the hyperbolic plane, (see Margenstern, 2000, 2007 and Margenstern, Morita, 2001) and we consider the global function defined on all possible configurations.…
Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given…
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an additional "pebble" movable along the input tape. Similarly as in the case of the classical two-way machines, it…
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reasoning only over finite execution fragments. Current…
We study algebraic properties of matrices whose rows are mutual neighbours, and are also neigbours of 0 ("neighbour" in the sense of a certain nilpotency condition). The intended application is in synthetic differential geometry. For a…
We investigate indeterminate points in discrete integrable system. They appear in singularity confinement phenomenon naturally. We develop a method to analyse indeterminate points of dynamical maps and using this method we clarify behaviour…