Related papers: Decision problems on unary probabilistic and quant…
Quantum mechanical systems exhibit an inherently probabilistic nature upon measurement. Using a quantum noise model to describe the stochastic evolution of the open quantum system and working in parallel with classical indeterministic…
First, we show that universality and other properties of general jumping finite automata are undecidable, which answers a question asked by Meduna and Zemek in 2012. Second, we close the study raised by \v{C}erno and Mr\'{a}z in 2010 by…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…
Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical…
We discuss some issues about probability in quantum mechanics, with particular emphasis on the GHZ theorem. We propose the usage of nonmonotonic upper probabilities as a tool to derive consistent joint upper probabilities for systems where…
Quantum Decision Theory, advanced earlier by the authors, and illustrated for lotteries with gains, is generalized to the games containing lotteries with gains as well as losses. The mathematical structure of the approach is based on the…
Non-commutative spacetime and quantum groups have been argued to capture non-classical features of spacetime and its symmetries in the low-energy limit of quantum gravity. In this letter, we show that employing the $SU_q(2)$ quantum group…
A rigorous general definition of quantum probability is given, which is valid for elementary events and for composite events, for operationally testable measurements as well as for inconclusive measurements, and also for non-commuting…
New insight into the correspondence between Quantum Chaos and Random Matrix Theory is gained by developing a semiclassical theory for the autocorrelation function of spectral determinants. We study in particular the unitary operators which…
Herein we survey the main results concerning quantum automata and machines with classical control. These machines were originally proposed by Sernadas et al in [37], during the FCT QuantLog project. First, we focus on the expressivity of…
We present in an informal way some recent results concerning a possible overlapping between classical unpredictability and quantum indeterminism.
The question whether indeterminism in quantum measurement outcomes is fundamental or is there a possibility of constructing a finer theory underlying quantum mechanics that allows no such indeterminism, has been debated for a long time. We…
The definitions of classical and quantum singularities in general relativity are reviewed. The occurence of quantum mechanical singularities in certain spherically symmetric and cylindrically symmetric (including infinite line…
We study the satisfiability problem of symbolic tree automata and decompose it into the satisfiability problem of the existential first-order theory of the input characters and the existential monadic second-order theory of the indices of…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…
It is shown how to map the quantum states of a system of free scalar particles one-to-one onto the states of a completely deterministic model. It is a classical field theory with a large (global) gauge group. The mapping is now also applied…
We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function. An alternative approach,…
This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with $\epsilon$-transitions. It gives an algorithm for testing the exponential ambiguity of an automaton $A$ in time…
We show how classical and quantum dualities, as well as duality relations that appear only in a sector of certain theories ("emergent dualities"), can be unveiled, and systematically established. Our method relies on the use of morphisms of…