Characterizations of quantum automata

Qiu, D; Ying, M

Characterizations of quantum automata

Qiu, D Ying, M

Permalink

Publication Type:: Journal Article
Citation:: Theoretical Computer Science, 2004, 312 (2-3), pp. 479 - 489
Issue Date:: 2004-01-30

Closed Access

	Filename	Description	Size
	2008004764OK.pdf		223.51 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Qiu, D	en_US
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X	en_US
dc.date.issued	2004-01-30	en_US
dc.identifier.citation	Theoretical Computer Science, 2004, 312 (2-3), pp. 479 - 489	en_US
dc.identifier.issn	0304-3975	en_US
dc.identifier.uri	http://hdl.handle.net/10453/9019
dc.description.abstract	We define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and verify that they are exactly equivalent to those measure-once quantum finite automata (MO-QFAs) in the literature. In particular, we define q quantum pushdown automata (qQPDAs) and QPDAs that are at least as powerful as those defined by Moore and Crutchfield, and especially we focus on demonstrating the equivalence between qQPDAs and QPDAs. Also, we discuss some of the properties of languages accepted by qQPDAs; for example, every cut-point language accepted by qQPDA is independent of the cut-point. © 2003 Elsevier B.V. All rights reserved.	en_US
dc.relation.ispartof	Theoretical Computer Science	en_US
dc.relation.isbasedon	10.1016/j.tcs.2003.08.007	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Characterizations of quantum automata	en_US
dc.type	Journal Article
utslib.citation.volume	2-3	en_US
utslib.citation.volume	312	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	08 Information and Computing Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	2-3	en_US
pubs.publication-status	Published	en_US
pubs.volume	312	en_US

Abstract:

We define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and verify that they are exactly equivalent to those measure-once quantum finite automata (MO-QFAs) in the literature. In particular, we define q quantum pushdown automata (qQPDAs) and QPDAs that are at least as powerful as those defined by Moore and Crutchfield, and especially we focus on demonstrating the equivalence between qQPDAs and QPDAs. Also, we discuss some of the properties of languages accepted by qQPDAs; for example, every cut-point language accepted by qQPDA is independent of the cut-point. © 2003 Elsevier B.V. All rights reserved.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/9019