Formal power series and regular operations on fuzzy languages

DOI10.1016/j.ins.2009.11.030zbMath1187.68323OpenAlexW2045766167MaRDI QIDQ2269825

Jelena Ignjatović, Miroslav Ćirić

Publication date: 11 March 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.11.030

zbMATH Keywords

languagepolynomialfuzzy automatonformal power seriesquantalefuzzy languagedeterministic automatonderivative automatonregular operations

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (19)

The universal fuzzy automaton ⋮ Weak bisimulations for fuzzy automata ⋮ Brzozowski type determinization for fuzzy automata ⋮ Unnamed Item ⋮ On closure properties of \(\mathcal{L}\)-valued linear languages ⋮ On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations ⋮ Bisimulations for fuzzy automata ⋮ Finite automata theory with membership values in lattices ⋮ Determinization of fuzzy automata via factorization of fuzzy states ⋮ Further improvements of determinization methods for fuzzy finite automata ⋮ A generalization of Myhill-Nerode theorem for fuzzy languages ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ A remark on Myhill-Nerode theorem for fuzzy languages ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Characterizations of regular ordered semigroups in terms of \((\alpha , \beta )\)-fuzzy generalized bi-ideals ⋮ Nondeterministic fuzzy automata ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ On minimal realization of fuzzy behaviour and associated categories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• On the recognizability of fuzzy languages. II
• On the recognizability of fuzzy languages. I
• Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
• The equivalence between fuzzy Mealy and fuzzy Moore machines
• 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
• Automata theory based on complete residuated lattice-valued logic: a categorical approach
• On fuzzy regular languages
• Determinism and fuzzy automata
• Algebraic aspects of families of fuzzy languages
• 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
• Weighted automata and weighted logics
• Determinization of fuzzy automata with membership values in complete residuated lattices
• The relationships among several types of fuzzy automata
• Algebraic properties of \(LA\)-languages
• On the definition of a family of automata
• Factorization of Fuzzy Automata

This page was built for publication: Formal power series and regular operations on fuzzy languages