Add to ORKGSince Edward Moore, finite automata theory has been inspired by physics, in particular by quantum complementarity. We review automaton complementarity, reversible automata and the connections to generalized urn models. Recent developments in quantum information theory may have appropriate formalizations in the automaton context
In the past year two different models of quantum finite automata have been proposed. The first mode...
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum lo...
AbstractAutomata theory based on quantum logic, called l-valued finite automata (l-VFAs), may be vie...
Abstract. Since Edward Moore, finite automata theory has been inspired by physics, in particular by ...
Complementarity is not only a feature of quantum mechanical systems but occurs also in the context o...
AbstractQuantum finite automata have been studied intensively since their introduction in late 1990s...
AbstractThis paper is a review of the connection between formulas of logic and quantum finite-state ...
Studies of computational complementarity properties in finite state interactive automata may shed li...
AbstractAutomata theory based on quantum logic, called l-valued finite automata (l-VFAs), may be vie...
Quantum finite automata were introduced by C.Moore and J.P.Crutchfield in [MC 97] and by A.Kondacs a...
AbstractQuantum finite automata have been studied intensively since their introduction in late 1990s...
AbstractThis paper is a review of the connection between formulas of logic and quantum finite-state ...
Abstract. We present five examples where quantum finite automata (QFAs) outperform their classical c...
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a qua...
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a qua...
In the past year two different models of quantum finite automata have been proposed. The first mode...
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum lo...
AbstractAutomata theory based on quantum logic, called l-valued finite automata (l-VFAs), may be vie...
Abstract. Since Edward Moore, finite automata theory has been inspired by physics, in particular by ...
Complementarity is not only a feature of quantum mechanical systems but occurs also in the context o...
AbstractQuantum finite automata have been studied intensively since their introduction in late 1990s...
AbstractThis paper is a review of the connection between formulas of logic and quantum finite-state ...
Studies of computational complementarity properties in finite state interactive automata may shed li...
AbstractAutomata theory based on quantum logic, called l-valued finite automata (l-VFAs), may be vie...
Quantum finite automata were introduced by C.Moore and J.P.Crutchfield in [MC 97] and by A.Kondacs a...
AbstractQuantum finite automata have been studied intensively since their introduction in late 1990s...
AbstractThis paper is a review of the connection between formulas of logic and quantum finite-state ...
Abstract. We present five examples where quantum finite automata (QFAs) outperform their classical c...
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a qua...
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a qua...
In the past year two different models of quantum finite automata have been proposed. The first mode...
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum lo...
AbstractAutomata theory based on quantum logic, called l-valued finite automata (l-VFAs), may be vie...