Related papers: Finite automata models of quantized systems: conce…
In this paper we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.
System behaviors are traditionally evaluated through binary classifications of correctness, which do not suffice for properties involving quantitative aspects of systems and executions. Quantitative automata offer a more nuanced approach,…
We introduce a quantum analogue of a classical synchronizing automaton. In classical case the state of a system evolves according to a set of rules forming an alphabet, and sequences of these rules, called words, govern its evolution.…
This article considers quantum systems described by a finite-dimensional complex Hilbert space $H$. We first define the concept of a finite observable on $H$. We then discuss ways of combining observables in terms of convex combinations,…
We study classical Hamiltonian systems in which the intrinsic proper time evolution parameter is related through a probability distribution to the physical time, which is assumed to be discrete. In this way, a physical clock with discrete…
Currently there is great interest in computational models consisting of underlying regular computational environments, and built on them distributed computational structures. Examples of such models are cellular automata, spatial…
We study 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (over 0.98), then the power of 1-way QFAs…
A learning algorithm based on state superposition principle is presented. The physical implementation analysis and simulated experiment results show that quantum mechanics can give helps in learning for more intelligent robot.
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 the literature, there exist several interesting hybrid models of finite automata which have both quantum and classical states. We call them semi-quantum automata. In this paper, we compare the descriptional power of these models with…
The notion of "closed systems" in Quantum Mechanics is discussed. For this purpose, we study two models of a quantum-mechanical system $P$ spatially far separated from the "rest of the universe" $Q$. Under reasonable assumptions on the…
We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…
We present a theory of automata with boundary for designing, modelling and analysing distributed systems. Notions of behaviour, design and simulation appropriate to the theory are defined. The problem of model checking for deadlock…
An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…
Some formulas and speculations are presented relative to integrable systems and quantum mechanics.
Recently, it has been argued that quantum mechanics is a complete theory, and that different quantum states do necessarily correspond to different elements of reality, under the assumptions that quantum mechanics is correct and that…
Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a…
Processes such as quantum computation, or the evolution of quantum cellular automata are typically described by a unitary operation implemented by an external observer. In particular, an interaction is generally turned on for a precise…
In statistical mechanics, it is well known that finite-state classical lattice models can be recast as quantum models, with distinct classical configurations identified with orthogonal basis states. This mapping makes classical statistical…
Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While…