scientific article; zbMATH DE number 2040892
From MaRDI portal
Publication:4452048
zbMATH Open1037.68058MaRDI QIDQ4452048FDOQ4452048
Beatrice Palano, Alberto Bertoni, Carlo Mereghetti
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2710/27100001.htm
Title of this publication is not available (Why is that?)
Recommendations
Cited In (43)
- State succinctness of two-way finite automata with quantum and classical states
- Superiority of exact quantum automata for promise problems
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
- Lower bounds on the size of semi-quantum finite automata
- Unbounded-error quantum computation with small space bounds
- Size lower bounds for quantum automata
- Title not available (Why is that?)
- Lifting query complexity to time-space complexity for two-way finite automata
- Exponentially more concise quantum recognition of non-RMM regular languages
- Equivalence checking of quantum finite-state machines
- Title not available (Why is that?)
- Trace monoids with idempotent generators and measure-only quantum automata
- Improved constructions of quantum automata
- Implementation and Application of Automata
- Learning quantum finite automata with queries
- Characterizations of one-way general quantum finite automata
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Quantum Automata Theory – A Review
- Mirrors and memory in quantum automata
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application
- Some algebraic properties of measure-once two-way quantum finite automata
- Hierarchy and equivalence of multi-letter quantum finite automata
- Determining the equivalence for one-way quantum finite automata
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata
- Quantum automata for some multiperiodic languages
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- On hybrid models of quantum finite automata
- Algebraic Methods in Quantum Informatics
- Characterizations of 1-Way Quantum Finite Automata
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
- One-Way Finite Automata with Quantum and Classical States
- Lower Bounds for Generalized Quantum Finite Automata
- Complexity of Promise Problems on Classical and Quantum Automata
- Quantum finite automata with control language
- On relation between linear temporal logic and quantum finite automata
- Mathematical logic and quantum finite state automata
- Improved Constructions of Quantum Automata
- Quantum finite automata: advances on Bertoni's ideas
- Preface
- Quantum Finite Automata: A Modern Introduction
- Languages Recognized with Unbounded Error by Quantum Finite Automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452048)
