The class of languages recognizable by 1-way quantum finite automata is not closed under union

Details The class of languages recognizable by 1-way quantum finite automata is not closed under union The class of languages recognizable by 1-way quantum finite automata is not closed under union

2000-01-04

arxiv.org/abs/quant-ph/0001005v1

Physics

Quantum Physics

13 pages, 9 figures

Scientific paper

In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular languages. In this paper we show, that class of languages recognizable by QFA is not closed under union, even not under any Boolean operation, where both arguments are significant.

Affiliated with

Also associated with

No associations

Rating

The class of languages recognizable by 1-way quantum finite automata is not closed under union does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The class of languages recognizable by 1-way quantum finite automata is not closed under union, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The class of languages recognizable by 1-way quantum finite automata is not closed under union will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-110528