Quantum versus deterministic counter automata
type: Item
instance of: scholarly article
title: Quantum versus deterministic counter automata
zbMATH Open document ID: 1080.68060
author: Tomohiro Yamasaki
author: Hirotada Kobayashi
author: Hideki Imai
published in: Theoretical Computer Science
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 2173062
zbMATH Keywords: Quantum computing
zbMATH Keywords: Automata theory
zbMATH Keywords: Counter automata
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.07.034
OpenAlex ID: W1968294243
cites work: Q4536348
cites work: Undecidability on quantum finite automata
cites work: Q4496246
cites work: Q4938665
cites work: Exact results for accepting probabilities of quantum automata.
cites work: Q2762497
cites work: Dense quantum coding and quantum finite automata
cites work: Two-way finite automata with quantum and classical states.
cites work: Q4473983
cites work: Characterizations of 1-Way Quantum Finite Automata
cites work: Counter machines and counter languages
cites work: Q4473989
cites work: SOFSEM 2000: Theory and practice of informatics. 27th conference on current trends in theory and practice of informatics, Milovy, Czech Republic, November 25--December 2, 2000. Proceedings
cites work: Two-Way Counter Machines and Diophantine Equations
cites work: Q4496253
cites work: Reversible space equals deterministic space
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Quantum automata and quantum grammars
cites work: Universality of a reversible two-counter machine
cites work: One-way probabilistic reversible and quantum one-counter automata.
DOI: 10.1016/J.TCS.2004.07.034
description: scientific article; zbMATH DE number 2173062