AbstractWe describe an algebra for composing automata which includes both classical and quantum entities. We illustrate by describing in detail a quantum protocol
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...
Abstract. We present five examples where quantum finite automata (QFAs) outperform their classical c...
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum lo...
AbstractWe describe an algebra for composing automata which includes both classical and quantum enti...
Structured transition systems have been widely used in the formal specification of computing systems...
<i>Abstract</i><div><br></div><div><br></div><div>The fundamentals of Lukasiewicz-Moisil logic algeb...
ABSTRACT The fundamentals of ÃLukasiewicz-Moisil logic algebras and their applications to complex g...
A novel approach to self-organizing, highly-complex systems (HCS), such as living organisms and arti...
To study quantum computation, it might be helpful to generalize structures from language and automat...
Complementarity is not only a feature of quantum mechanical systems but occurs also in the context o...
AbstractWithin the Geometry of Interaction (GoI) paradigm, we present a setting that enables qualita...
Since Edward Moore, finite automata theory has been inspired by physics, in particular by quantum co...
We study quantum information and computation from a novel point of view. Our approach is based on re...
AbstractWe analyze some features of the behaviour of quantum automata, providing analogies and diffe...
The fundamentals of ÃLukasiewicz-Moisil logic algebras and their applica-tions to complex genetic ne...
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...
Abstract. We present five examples where quantum finite automata (QFAs) outperform their classical c...
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum lo...
AbstractWe describe an algebra for composing automata which includes both classical and quantum enti...
Structured transition systems have been widely used in the formal specification of computing systems...
<i>Abstract</i><div><br></div><div><br></div><div>The fundamentals of Lukasiewicz-Moisil logic algeb...
ABSTRACT The fundamentals of ÃLukasiewicz-Moisil logic algebras and their applications to complex g...
A novel approach to self-organizing, highly-complex systems (HCS), such as living organisms and arti...
To study quantum computation, it might be helpful to generalize structures from language and automat...
Complementarity is not only a feature of quantum mechanical systems but occurs also in the context o...
AbstractWithin the Geometry of Interaction (GoI) paradigm, we present a setting that enables qualita...
Since Edward Moore, finite automata theory has been inspired by physics, in particular by quantum co...
We study quantum information and computation from a novel point of view. Our approach is based on re...
AbstractWe analyze some features of the behaviour of quantum automata, providing analogies and diffe...
The fundamentals of ÃLukasiewicz-Moisil logic algebras and their applica-tions to complex genetic ne...
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...
Abstract. We present five examples where quantum finite automata (QFAs) outperform their classical c...
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum lo...
DOI
Add to ORKG