Quantum finite automata and probabilistic reversible automata: R-trivial idempotent languages

DOI10.1007/978-3-642-22993-0_33MaRDI QIDQ3088053zbMATH OpenOpenAlexFDO

Authors Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs

Publication date 17 August 2011

Published in Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22993-0_33

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Multi-letter Reversible and Quantum Finite Automata
• On a class of languages recognizable by probabilistic reversible decide-and-halt automata
• Implementation and Application of Automata
• Algebraic characterization of the class of languages recognized by measure only quantum automata
• Algebraic results on quantum automata

Cited in

(7)

• On a class of languages recognizable by probabilistic reversible decide-and-halt automata
• Quantum finite automata: a modern introduction
• Varieties Generated by Certain Models of Reversible Finite Automata
• scientific article; zbMATH DE number 2090013 (Why is no real title available?)
• Algebraic characterization of the class of languages recognized by measure only quantum automata
• Multi-letter Reversible and Quantum Finite Automata
• Trace monoids with idempotent generators and measure-only quantum automata

This page was built for publication: Quantum finite automata and probabilistic reversible automata: \(\mathcal{R}\)-trivial idempotent languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088053)