Related papers: Defining and composing big state machines
A sharper formulation is presented for an interpretation of quantum mechanics advocated by author. As an essential element we put forward conservation laws concerning the ontological nature of a variable, and the uncertainties concerning…
The asynchronous systems $f$ are the models of the asynchronous circuits from digital electrical engineering. They are multi-valued functions that associate to each input $u:\mathbf{R}\to \{0,1\}^{m}$ a set of states $x\in f(u),$ where…
Field-theoretic construction of functional representations of solutions of stochastic differential equations and master equations is reviewed. A generic expression for the generating function of Green functions of stochastic systems is put…
In this paper we define and study a new class of states (the empty states). These states are the superposition of two identical states (self-superposition state). We defined three different representations of theses states, namely, the…
For arbitrary linear time-invariant systems, the existence of a strong functional observer is investigated. Such observer determines, from the available measurement on the plant, an estimate of a function of the state and the input. This…
Semantic parsing is a means of taking natural language and putting it in a form that a computer can understand. There has been a multitude of approaches that take natural language utterances and form them into lambda calculus expressions --…
Multi-stack machines and Turing machines can simulate to each other. In this note, we give a succinct definition of multi-stack machines, and from this definition it is clearly seen that pushdown automata and deterministic finite automata…
In this paper, we provide a compositional methodology for constructing symbolic models for networks of discrete-time switched systems. We first define a notion of so-called augmented-storage functions to relate switched subsystems and their…
The problem of quantum state filtering consists of determining whether an unknown quantum state, which is chosen from a known set of states, is either a particular, specified state, or not. We consider this problem for the case that the…
State-machine replication, a fundamental approach to fault tolerance, requires replicas to execute commands deterministically, which usually results in sequential execution of commands. Sequential execution limits performance and underuses…
This work is an introduction to the author's contributions to the SOC area, resulting from his PhD research activity. It focuses on the problem of automatically composing a desired service, given a set of available ones and a target…
Given a function from $\mathbb{Z}_n$ to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over $\mathbb{Z}_n$ by constructing…
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alternative to the standard one deriving from Koskenniemi's work: it…
We construct a quantum machine which, by using asymmetric cloner, deals with disentangling and broadcasting entanglement in a single unitary evolution. The attainable maximum value of the scaling parameter $s$ for disentangling is identical…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…
There has been a significant research interest in employing large language models to empower intelligent robots with complex reasoning. Existing work focuses on harnessing their abilities to reason about the histories of their actions and…
A concept of "evolving categories" is suggested to build a simple, scalable, mathematically consistent framework for representing in uniform way both data and algorithms. A state machine for executing algorithms becomes clear, rich and…
Linearity allows several versions of reality to simultaneously exist in the state vector. But it implies that there is no interaction between versions, and that there will never be perception of more than one version. It also implies, in…
We define two versions of compositions of matrix-valued rational functions of appropriate sizes and whenever analytic at infinity, offer a set of formulas for the corresponding state-space realization, in terms of the realizations of the…
We start by an introduction to the basic concepts of computability theory and the introduction of the concept of Turing machine and computation universality. Then se turn to the exploration of trade-offs between different measures of…