A generalization of Myhill-Nerode theorem for fuzzy languages

DOI10.1016/j.fss.2015.12.011zbMath1378.68104OpenAlexW2218288489MaRDI QIDQ679811

José R. González de Mendívil

Publication date: 22 January 2018

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2015.12.011

zbMATH Keywords

fuzzy languagesMyhill-Nerode theoremfuzzy deterministic finite automataright equivalence relations

Mathematics Subject Classification ID

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

Related Items (4)

Two dimensional fuzzy regular languages ⋮ Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them ⋮ Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders ⋮ Conditions for the existence of maximal factorizations

Cites Work

• Unnamed Item
• Unnamed Item
• Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
• Determinization of fuzzy automata via factorization of fuzzy states
• Finite automata theory with membership values in lattices
• On the recognizability of fuzzy languages. II
• Myhill-Nerode type theory for fuzzy languages and automata
• Fuzzy language on free monoid
• Determinism and fuzzy automata
• Formal power series and regular operations on fuzzy languages
• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings
• Linear Automaton Transformations
• Fuzzy Languages

This page was built for publication: A generalization of Myhill-Nerode theorem for fuzzy languages