Algebraic properties on the cuts of lattice-valued regular languages
From MaRDI portal
Publication:937264
DOI10.1007/s00500-007-0271-yzbMath1161.68028WikidataQ62038211 ScholiaQ62038211MaRDI QIDQ937264
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
Related Items
Myhill-Nerode type theory for fuzzy languages and automata, Coding tree languages based on lattice-valued logic
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item