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

DOI10.1016/J.IJAR.2020.11.002OpenAlexW3099803027MaRDI QIDQ2658032FDOQ2658032

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

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

zbMATH Keywords

robustnessquantum logicorthomodular latticenondeterministic finite automatonlanguage equivalence

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Alternating-time temporal logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum Complexity Theory
• Handbook of weighted automata
• Nondeterministic fuzzy automata
• Orthomodular structures as quantum logics. Transl. from the Slovak
• Title not available (Why is that?)
• Finite automata theory with membership values in lattices
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Automata theory based on complete residuated lattice-valued logic. II
• On the definition of a family of automata
• Approximation and robustness of fuzzy finite automata
• The relationships among several types of fuzzy automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata theory based on quantum logic: reversibilities and pushdown automata
• A theory of computation based on quantum logic. I
• Automata theory based on quantum logic. II.
• Automata theory based on quantum logic: Some characterizations
• Weighted finite automata over strong bimonoids
• Title not available (Why is that?)
• Simulation for lattice-valued doubly labeled transition systems
• Notes on automata theory based on quantum logic
• Title not available (Why is that?)
• Model checking discounted temporal properties
• Nondeterministic fuzzy automata with membership values in complete residuated lattices
• Algebraic aspects of families of fuzzy languages
• The relationships among several forms of 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)