Once production of your article has started, you can track the status of your article via Track Your Accepted Article. Help expand a public dataset of research that support the SDGs. Quantum computers promise dramatic improvements in our ability to efficiently solve classically intractable problems ranging from cryptosystems to simulation of quantum systems, and to optimization and machine learning. Quantum computing has attracted attention in the past two decades because it was found that computers exploiting quantum mechanics are able to outperform classical digital computers in certain areas like factoring integers and searching. QCA is a revolutionary computing paradigm that is well suited to nano-electronic implementation and scaling to molecular dimensions. In QCA, binary information is encoded in the position of single electrons among a group of dots forming a cell.
On the power of quantum finite state automata
 Quantum finite automata: survey, status and research directions
Automata theory is the study of abstract machines and automata , as well as the computational problems that can be solved using them. It is a theory in theoretical computer science. An automaton Automata in plural is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. The figure at right illustrates a finite-state machine , which belongs to a well-known type of automaton. This automaton consists of states represented in the figure by circles and transitions represented by arrows. As the automaton sees a symbol of input, it makes a transition or jump to another state, according to its transition function , which takes the previous state and current input symbol as its arguments. Automata theory is closely related to formal language theory.
Donate to arXiv
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It only takes a minute to sign up. Connect and share knowledge within a single location that is structured and easy to search. What are current research topics connected with tree automata? I'm particularly interested with connection between automatas, logics and databases.
Hyperproperties have received increasing attention in the last decade due to their importance e. Past approaches have focussed on synchronous analyses, i. We show that the expressive power of both models coincides over fixed path assignments. The high expressive power of both models is evidenced by the fact that decision problems of interest are highly undecidable, i. As a remedy, we propose approximative analyses for both models that also induce natural decidable fragments.