Automata theory based on quantum logic. I

DOI10.1023/A:1003642222321zbMath0962.03029MaRDI QIDQ1586380

Ming Sheng Ying

Publication date: 25 February 2001

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1003642222321

zbMATH Keywords

quantum logic; finite automata; quantum computing; language recognition

Mathematics Subject Classification ID

03D05: Automata and formal grammars in connection with logical questions

03G12: Quantum logic

Related Items

LOGICS FROM QUANTUM COMPUTATION, A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata, Computing power of Turing machines in the framework of unsharp quantum logic, An improved algorithm for determinization of weighted and fuzzy automata, Weighted automata and multi-valued logics over arbitrary bounded lattices, Model checking computation tree logic over finite lattices, Myhill-Nerode type theory for fuzzy languages and automata, Determinization of weighted finite automata over strong bimonoids, Weak QMV algebras and some ring-like structures, A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata, Characterization of tree automata based on quantum logic, On coverings of products of uninitialized sequential quantum machines, On intuitionistic fuzzy context-free languages, Automata theory based on quantum logic: recognizability and accessibility, Finite state and finite stop quantum languages, A theory of computation based on quantum logic. I, LOGICS FROM QUANTUM COMPUTATION WITH BOUNDED ADDITIVE OPERATORS, WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS, QUANTUM COMPUTATIONAL FINITE-VALUED LOGICS