scientific article; zbMATH DE number 2090013

MaRDI QIDQ4808680zbMATH OpenFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

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

(14)

• scientific article; zbMATH DE number 7104930 (Why is no real title available?)
• Size lower bounds for quantum automata
• Exponentially more concise quantum recognition of non-RMM regular languages
• scientific article; zbMATH DE number 1839459 (Why is no real title available?)
• 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
• Complexity of promise problems on classical and quantum automata
• On a class of languages recognizable by probabilistic reversible decide-and-halt automata
• Some formal tools for analyzing 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.
• State complexity of one-way quantum finite automata together with classical states

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)