Automata theory based on quantum logic II

Ying, M

Automata theory based on quantum logic II

Ying, M

Permalink

Publication Type:: Journal Article
Citation:: International Journal of Theoretical Physics, 2000, 39 (11), pp. 2545 - 2557
Issue Date:: 2000-01-01

Closed Access

	Filename	Description	Size
	2008004759OK.pdf		101.62 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	Ying, M https://orcid.org/0000-0003-4847-702X	en_US
dc.date.issued	2000-01-01	en_US
dc.identifier.citation	International Journal of Theoretical Physics, 2000, 39 (11), pp. 2545 - 2557	en_US
dc.identifier.issn	0020-7748	en_US
dc.identifier.uri	http://hdl.handle.net/10453/8937
dc.description.abstract	We establish the pumping lemma in automata theory based on quantum logic under certain conditions on implication, and discuss the recognizability by the product and union of orthomodular lattice-valued (quantum) automata. In particular, we show that the equivalence between the recognizabilty by the product of automata and the conjunction of the recognizabilities by the factor automata is equivalent to the distributivity of meet over union in the truth-value set.	en_US
dc.relation.ispartof	International Journal of Theoretical Physics	en_US
dc.relation.isbasedon	10.1023/A:1026453524064	en_US
dc.subject.classification	Nuclear & Particles Physics	en_US
dc.title	Automata theory based on quantum logic II	en_US
dc.type	Journal Article
utslib.citation.volume	11	en_US
utslib.citation.volume	39	en_US
utslib.for	080199 Artificial Intelligence and Image Processing not elsewhere classified	en_US
utslib.for	080203 Computational Logic and Formal Languages	en_US
utslib.for	020603 Quantum Information, Computation and Communication	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	02 Physical 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	11	en_US
pubs.publication-status	Published	en_US
pubs.volume	39	en_US

Abstract:

We establish the pumping lemma in automata theory based on quantum logic under certain conditions on implication, and discuss the recognizability by the product and union of orthomodular lattice-valued (quantum) automata. In particular, we show that the equivalence between the recognizabilty by the product of automata and the conjunction of the recognizabilities by the factor automata is equivalent to the distributivity of meet over union in the truth-value set.

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

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