scientific article; zbMATH DE number 2040892
From MaRDI portal
Publication:4452048
zbMath1037.68058MaRDI QIDQ4452048
Beatrice Palano, Carlo Mereghetti, Alberto Bertoni
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2710/27100001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (38)
Lower bounds on the size of semi-quantum finite automata ⋮ One-Way Finite Automata with Quantum and Classical States ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ Quantum Finite Automata: A Modern Introduction ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ Size lower bounds for quantum automata ⋮ Superiority of exact quantum automata for promise problems ⋮ Lifting query complexity to time-space complexity for two-way finite automata ⋮ Learning quantum finite automata with queries ⋮ Mirrors and memory in quantum automata ⋮ Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ Algebraic Methods in Quantum Informatics ⋮ Equivalence checking of quantum finite-state machines ⋮ Lower Bounds for Generalized Quantum Finite Automata ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Preface ⋮ Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties ⋮ Quantum automata for some multiperiodic languages ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Small size quantum automata recognizing some regular languages ⋮ Unbounded-error quantum computation with small space bounds ⋮ Some formal tools for analyzing quantum automata. ⋮ Hierarchy and equivalence of multi-letter quantum finite automata ⋮ Trace monoids with idempotent generators and measure-only quantum automata ⋮ Determining the equivalence for one-way quantum finite automata ⋮ Some algebraic properties of measure-once two-way quantum finite automata ⋮ Improved constructions of quantum automata ⋮ On a class of languages recognizable by probabilistic reversible decide-and-halt automata ⋮ Mathematical logic and quantum finite state automata ⋮ Languages Recognized with Unbounded Error by Quantum Finite Automata ⋮ Quantum Automata Theory – A Review ⋮ Characterizations of one-way general quantum finite automata ⋮ Multi-letter quantum finite automata: decidability of the equivalence and minimization of states ⋮ On relation between linear temporal logic and quantum finite automata ⋮ Improved Constructions of Quantum Automata ⋮ Quantum finite automata with control language ⋮ Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata ⋮ On hybrid models of quantum finite automata
This page was built for publication: