Algebraic properties on the cuts of lattice-valued regular languages

DOI10.1007/s00500-007-0271-yzbMath1161.68028OpenAlexW1992806625WikidataQ62038211 ScholiaQ62038211MaRDI QIDQ937264

Changjian Liang, Yong-Ming Li

Publication date: 20 August 2008

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

Full work available at URL: https://doi.org/10.1007/s00500-007-0271-y

zbMATH Keywords

Closure propertiesFuzzy languagesLattice-valued regular languagesLevel structure

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (2)

Coding tree languages based on lattice-valued logic ⋮ Myhill-Nerode type theory for fuzzy languages and automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• The equivalence between fuzzy Mealy and fuzzy Moore machines
• Fuzzy language on free monoid
• Fuzzy recognizers and recognizable sets
• Algebraic aspects of families of fuzzy languages
• The relationships among several types of fuzzy automata
• Algebraic properties of \(LA\)-languages
• Fuzzy sets
• A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems

This page was built for publication: Algebraic properties on the cuts of lattice-valued regular languages