scientific article; zbMATH DE number 2090013
From MaRDI portal
Publication:4808680
zbMATH Open1077.68043MaRDI QIDQ4808680FDOQ4808680
Authors: Marats Golovkins, Maksim Kravtsev 
Publication date: 12 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2387/23870574.htm
Title of this publication is not available (Why is that?)
Recommendations
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata
- Quantum finite automata and probabilistic reversible automata: \(\mathcal{R}\)-trivial idempotent languages
- The complexity of probabilistic versus quantum finite automata
- scientific article; zbMATH DE number 6440119
- One-way probabilistic reversible and quantum one-counter automata.
Cited In (13)
- Title not available (Why is that?)
- Size lower bounds for quantum automata
- Exponentially more concise quantum recognition of non-RMM regular languages
- Title not available (Why is that?)
- Trace monoids with idempotent generators and measure-only quantum automata
- Characterizations of one-way general quantum finite automata
- Artin’s Conjecture and Size of Finite Probabilistic Automata
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata
- Some formal tools for analyzing quantum automata.
- Complexity of Promise Problems on Classical and Quantum Automata
- Quantum finite automata with control language
- A unification of probabilistic choice within a design-based model of reversible computation
- One-way probabilistic reversible and quantum one-counter 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 Q4808680)
