Publication:4452048
From MaRDI portal
zbMath1037.68058MaRDI QIDQ4452048
Carlo Mereghetti, Beatrice Palano, Alberto Bertoni
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2710/27100001.htm
Related Items
Improved Constructions of Quantum Automata, Preface, Trace monoids with idempotent generators and measure-only quantum automata, Unbounded-error quantum computation with small space bounds, Characterizations of one-way general quantum finite automata, Multi-letter quantum finite automata: decidability of the equivalence and minimization of states, 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, Hierarchy and equivalence of multi-letter quantum finite automata, Quantum automata for some multiperiodic languages, Small size quantum automata recognizing some regular languages, Some formal tools for analyzing quantum automata., Determining the equivalence for one-way quantum finite automata, Quantum Automata Theory – A Review, Languages Recognized with Unbounded Error by Quantum Finite Automata, Quantum finite automata with control language, Algebraic Methods in Quantum Informatics, Lower Bounds for Generalized Quantum Finite Automata
