Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness

DOI10.1016/J.IJAR.2020.11.002MaRDI QIDQ2658032zbMATH OpenOpenAlexFDO

Authors Haihui Wang, Luyao Zhao, Ping Li

Publication date 18 March 2021

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2020.11.002

zbMATH Keywords

robustnessquantum logicorthomodular latticenondeterministic finite automatonlanguage equivalence

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Nondeterministic fuzzy automata with membership values in complete residuated lattices
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Automata theory based on quantum logic: Some characterizations
• Relationships among several types of finite automata based on quantum logic
• A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3695177 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1028822 (Why is no real title available?)
• scientific article; zbMATH DE number 1512853 (Why is no real title available?)
• scientific article; zbMATH DE number 3807678 (Why is no real title available?)
• scientific article; zbMATH DE number 5182234 (Why is no real title available?)
• A theory of computation based on quantum logic. I
• Algebraic aspects of families of fuzzy languages
• Alternating-time temporal logic
• Approximation and robustness of fuzzy finite automata
• Automata theory based on complete residuated lattice-valued logic. II
• Automata theory based on quantum logic. II.
• Automata theory based on quantum logic: Some characterizations
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Finite automata theory with membership values in lattices
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Handbook of weighted automata
• Model checking discounted temporal properties
• Nondeterministic fuzzy automata
• Nondeterministic fuzzy automata with membership values in complete residuated lattices
• Notes on automata theory based on quantum logic
• On the definition of a family of automata
• Orthomodular structures as quantum logics. Transl. from the Slovak
• Quantum Complexity Theory
• Simulation for lattice-valued doubly labeled transition systems
• The relationships among several forms of weighted finite automata over strong bimonoids
• The relationships among several types of fuzzy automata
• Weighted finite automata over strong bimonoids

Cited in

(7)

• Characterization of tree automata based on quantum logic
• Relativizations of nonuniform quantum finite automata families
• Lattices of quantum automata
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• Relationships among several types of finite automata based on quantum logic
• Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation
• Nondeterministic fuzzy automata with membership values in complete residuated lattices

This page was built for publication: Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2658032)