Finite Automata Based on Quantum Logic and Their Determinization

Details Finite Automata Based on Quantum Logic and Their Determinization Finite Automata Based on Quantum Logic and Their Determinization

2007-12-28

arxiv.org/abs/0712.4341v1

Computer Science

Logic in Computer Science

Scientific paper

We give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between orthomodular lattice-valued finite automata, orthomodular lattice-valued deterministic finite automata and orthomodular lattice-valued finite automata with empty string-moves. Based on these equivalences, we study the algebraic operations on orthomodular lattice-valued regular languages, then we establish Kleene theorem in the frame of quantum logic.

Affiliated with

Also associated with

No associations

Rating

Finite Automata Based on Quantum Logic and Their Determinization 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 Finite Automata Based on Quantum Logic and Their Determinization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite Automata Based on Quantum Logic and Their Determinization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508290