Finite Automata Based on Quantum Logic and Their Determinization

Simple item page
dc.creatorLi, Yongming
dc.date2007-12-28
dc.date.accessioned2026-07-07T08:51:35Z
dc.date.available2026-07-07T08:51:35Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0712.4341
dc.identifierhttp://arxiv.org/abs/0712.4341
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144986
dc.subjectLogic in Computer Science
dc.titleFinite Automata Based on Quantum Logic and Their Determinization
dc.typetext

Files

Collections

arXiv