Finite Automata Based on Quantum Logic and Their Determinization
Logic in Computer Science
2007-12-31 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0712.4341,
title = {Finite Automata Based on Quantum Logic and Their Determinization},
author = {Yongming Li},
journal= {arXiv preprint arXiv:0712.4341},
year = {2007}
}