Formal power series and regular operations on fuzzy languages
From MaRDI portal
Publication:2269825
DOI10.1016/J.INS.2009.11.030zbMATH Open1187.68323OpenAlexW2045766167MaRDI QIDQ2269825FDOQ2269825
Authors: 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
Recommendations
formal power seriespolynomialfuzzy automatonfuzzy languagequantalelanguagedeterministic automatonderivative automatonregular operations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- 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
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Title not available (Why is that?)
- Factorization of Fuzzy Automata
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- 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
- On the definition of a family of automata
- Title not available (Why is that?)
- The relationships among several types of fuzzy automata
- Algebraic properties of \(LA\)-languages
- Regular grammars with truth values in lattice-ordered monoid and their languages
- The equivalence between fuzzy Mealy and fuzzy Moore machines
- Weighted automata and weighted logics
- Algebraic aspects of families of fuzzy languages
Cited In (20)
- Bisimulations for fuzzy automata
- Brzozowski type determinization for fuzzy automata
- The universal fuzzy automaton
- Weak bisimulations for fuzzy automata
- Nondeterministic fuzzy automata
- An improved algorithm for determinization of weighted and fuzzy automata
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Finite automata theory with membership values in lattices
- Computation of the greatest simulations and bisimulations between fuzzy automata
- A remark on Myhill-Nerode theorem for fuzzy languages
- On minimal realization of fuzzy behaviour and associated categories
- Determinization of weighted finite automata over strong bimonoids
- Construction of fuzzy automata from fuzzy regular expressions
- Characterizations of regular ordered semigroups in terms of \((\alpha , \beta )\)-fuzzy generalized bi-ideals
- Title not available (Why is that?)
- On closure properties of \(\mathcal{L}\)-valued linear languages
- Determinization of fuzzy automata via factorization of fuzzy states
- Title not available (Why is that?)
- A generalization of Myhill-Nerode theorem for fuzzy languages
- Further improvements of determinization methods for fuzzy finite automata
This page was built for publication: Formal power series and regular operations on fuzzy languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269825)
