Automata theory based on lattice-ordered semirings

DOI10.1007/s00500-010-0565-3zbMath1237.68116OpenAlexW2055907567MaRDI QIDQ422445

Yun Shang, Xian Lu, Ru-qian Lu

Publication date: 16 May 2012

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-010-0565-3

zbMATH Keywords

\({\mathcal{K}}\) automata\({\mathcal{K}}\) regular expressions\({\mathcal{K}}\) regular grammars\({\mathcal{K}}\) regular languageslattice-ordered semirings

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Ordered rings, algebras, modules (06F25)

Related Items (2)

Algebraic properties of complete residuated lattice valued tree automata ⋮ Coding tree languages based on lattice-valued logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Observations on non-commutative fuzzy logic
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Regular grammars with truth values in lattice-ordered monoid and their languages
• The equivalence between fuzzy Mealy and fuzzy Moore machines
• Predictive functional control based on fuzzy model: Comparison with linear predictive functional control and PID control
• Determinization of fuzzy automata with membership values in complete residuated lattices
• The relationships among several types of fuzzy automata
• A theory of computation based on quantum logic. I
• Semirings and pseudo MV algebras
• A non-commutative generalization of MV-algebras
• Pseudo MV-algebras are intervals in ℓ-groups
• Automata, Languages and Programming

This page was built for publication: Automata theory based on lattice-ordered semirings