Efficient probability amplification in two-way quantum finite automata
type: Item
instance of: scholarly article
title: Efficient probability amplification in two-way quantum finite automata
zbMATH Open document ID: 1163.68026
author: Abuzer Yakaryılmaz
author: A. C. Cem Say
published in: Theoretical Computer Science
publication date: 2009-05-19T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 5554708
zbMATH Keywords: two-way quantum finite automata
zbMATH Keywords: probability amplification
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.01.029
OpenAlex ID: W1963986274
cites work: Q2762497
cites work: Two-way finite automata with quantum and classical states.
cites work: Regular languages accepted by quantum automata
cites work: Characterizations of 1-Way Quantum Finite Automata
cites work: Q3947125
cites work: Q4503144
cites work: Quantum automata and quantum grammars
cites work: Characterizations of quantum automata
cites work: Q5541340
DOI: 10.1016/J.TCS.2009.01.029
description: scientific article; zbMATH DE number 5554708