Automata theory based on quantum logic. I

DOI10.1023/A:1003642222321zbMath0962.03029OpenAlexW4244515670MaRDI 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 logicfinite automataquantum computinglanguage recognition

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Quantum logic (03G12)

Related Items

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