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

DOI10.1016/j.ijar.2020.11.002OpenAlexW3099803027MaRDI QIDQ2658032

Ping Li, Luyao Zhao, Haihui Wang

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

robustnessorthomodular latticequantum logiclanguage equivalencenondeterministic finite automaton

Mathematics Subject Classification ID

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

Related Items (2)

Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation ⋮ Characterization of tree automata based on quantum logic

Cites Work

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

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