On closure properties of \(\mathcal{L}\)-valued linear languages
From MaRDI portal
Publication:6081537
DOI10.1016/j.fss.2020.09.012zbMath1522.03153OpenAlexW3090060542MaRDI QIDQ6081537
Regivan H. N. Santiago, Valdigleis S. Costa, Benjamín René Callejas Bedregal
Publication date: 26 October 2023
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2020.09.012
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- On the recognizability of fuzzy languages. II
- On the computing power of fuzzy Turing machines
- On the recognizability of fuzzy languages. I
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Automata theory based on complete residuated lattice-valued logic
- Myhill-Nerode type theory for fuzzy languages and automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- On fuzzy regular languages
- Information retrieval from interval-valued fuzzy automata through \(K_\alpha\) operators
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- Algebraic aspects of families of fuzzy languages
- On typical hesitant fuzzy automata
- Formal power series and regular operations on fuzzy languages
- Canonization of max-min fuzzy automata
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata
- Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
- On Fuzzy Logic I Many‐valued rules of inference
- Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
- On a family of linear grammars
- Fuzzy sets
- Some aspects of probabilistic automata
- Three models for the description of language
This page was built for publication: On closure properties of \(\mathcal{L}\)-valued linear languages