Related papers: Determinism in Multi-Soliton Automata
Describing complex phenomena by means of cellular automata (CA) has shown to be a very effective approach in pure and applied sciences. In fact, the number of published papers concerning this topic has tremendously increased over the last…
We propose a new description of dynamics of autonomous mechanical systems which includes the momentum-velocity relation. This description is formulated as a variational principle of virtual action more complete than the Hamilton Principle.…
Machine learning (ML) has emerged as a pervasive tool in science, engineering, and beyond. Its success has also led to several synergies with molecular dynamics (MD) simulations, which we use to identify and characterize the major…
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitrarily close to 1? This problem was proved undecidable recently.…
Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of…
We consider a family of cellular automata $\Phi(n,k)$ associated with infinite reduced elements on the affine symmetric group $\hat S_n$, which is a tropicalization of the rational maps introduced by two of the authors. We study the soliton…
Solvable vertex models in a ferromagnetic regime give rise to soliton cellular automata at q=0. By means of the crystal base theory, we study a class of such automata associated with the quantum affine algebra U_q(g_n) for non exceptional…
We define a variant of team semantics called multiteam semantics based on multisets and study the properties of various logics in this framework. In particular, we define natural probabilistic versions of inclusion and independence atoms…
Monotonic abstraction is a technique introduced in model checking parameterized distributed systems in order to cope with transitions containing global conditions within guards. The technique has been re-interpreted in a declarative setting…
Declarative machine learning (ML) aims at the high-level specification of ML tasks or algorithms, and automatic generation of optimized execution plans from these specifications. The fundamental goal is to simplify the usage and/or…
Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We…
Matrix mechanics is developed to describe the bound state spectra in few- and many-electron atoms, ions and molecules. Our method is based on the matrix factorization of many-electron (or many-particle) Coulomb Hamiltonians which are…
In this paper, we examine the concept of modularity, an often cited advantage of the ruled-based representation methodology. We argue that the notion of modularity consists of two distinct concepts which we call syntactic modularity and…
We formulate the soliton equations on the lattice in terms of the reduced Moyal algebra which includes one parameter. The vanishing limit of the parameter leads to the continuous soliton equations.
Nondeterministic Discounted-Sum Automata (NDAs) are nondeterministic finite automata equipped with a discounting factor $\lambda>1$, and whose transitions are labelled by weights. The value of a run of an NDA is the discounted sum of the…
The identification of a deterministic finite automaton (DFA) from labeled examples is a well-studied problem in the literature; however, prior work focuses on the identification of monolithic DFAs. Although monolithic DFAs provide accurate…
Automata learning is a technique that has successfully been applied in verification, with the automaton type varying depending on the application domain. Adaptations of automata learning algorithms for increasingly complex types of automata…
Weighted automata is a basic tool for specification in quantitative verification, which allows to express quantitative features of analysed systems such as resource consumption. Quantitative specification can be assisted by automata…
Causality has been often confused with the notion of determinism. It is mandatory to separate the two notions in view of the debate about quantum foundations. Quantum theory provides an example of causal not-deterministic theory. Here we…
It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections…