scientific article; zbMATH DE number 1759400
From MaRDI portal
Publication:4536348
zbMATH Open0996.68086MaRDI QIDQ4536348FDOQ4536348
Authors: Aida Gainutdinova, F. Ablayev 
Publication date: 4 November 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (21)
- On the power of one-way automata with quantum and classical states
- Size lower bounds for quantum automata
- Title not available (Why is that?)
- Exponentially more concise quantum recognition of non-RMM regular languages
- Improved constructions of quantum automata
- Lower bounds on the size of quantum automata accepting unary languages.
- Quantum versus deterministic counter automata
- Some algebraic properties of measure-once two-way quantum finite automata
- On the power of one-way automata with quantum and classical states
- Determining the equivalence for one-way quantum finite automata
- Developments in Language Theory
- Some formal tools for analyzing quantum automata.
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- Dense quantum coding and a lower bound for 1-way quantum automata
- Lower Bounds for Generalized Quantum Finite Automata
- Size lower bounds for quantum automata
- Title not available (Why is that?)
- One-way probabilistic reversible and quantum one-counter automata.
- Quantum automata theory -- a review
- Quantum finite automata: advances on Bertoni's ideas
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 Q4536348)
