Minimization of lattice finite automata and its application to the decomposition of lattice languages
From MaRDI portal
Publication:2372275
DOI10.1016/J.FSS.2007.03.003zbMATH Open1123.68063OpenAlexW2080187126WikidataQ62038234 ScholiaQ62038234MaRDI QIDQ2372275FDOQ2372275
Authors: Yongming Li, Witold Pedrycz 
Publication date: 26 July 2007
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2007.03.003
Recommendations
accessibilityfuzzy finite automatonfuzzy regular languagecoaccessibilityfuzzy unitary and fuzzy prefix language
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fuzzy automata and languages
- On fuzzy regular languages
- Minimization of fuzzy finite automata
- Determinism and fuzzy automata
- Max-product machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Title not available (Why is that?)
- On quotient machines of a fuzzy automaton and the minimal machine
- Title not available (Why is that?)
- Minimization algorithm of fuzzy finite automata.
- A categorical approach to lattice-valued fuzzy automata
- Fuzzy recognizers and recognizable sets
- Fuzzy discrete structures
- Fuzzy language on free monoid
- Algebraic aspects of families of fuzzy languages
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Equivalence, reduction and minimization of finite fuzzy-automata
- Semigroup homomorphisms and fuzzy automata
Cited In (38)
- Algebraic properties of complete residuated lattice valued tree automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Model checking of linear-time properties in multi-valued systems
- Minimizing deterministic lattice automata
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- A note on cut-worthiness of recognizable tree series
- Title not available (Why is that?)
- Bisimulations for fuzzy automata
- Brzozowski type determinization for fuzzy automata
- The universal fuzzy automaton
- Minimization of automata for liveness languages
- Finite automata theory with membership values in lattices
- Weighted finite automata over strong bimonoids
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- Myhill-Nerode type theory for fuzzy languages and automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
- Characterizations of complete residuated lattice-valued finite tree automata
- Construction of fuzzy automata from fuzzy regular expressions
- State hyperstructures of tree automata based on lattice-valued logic
- On minimal realization for a fuzzy language and Brzozowski's algorithm
- Minimal realization for fuzzy behaviour: a bicategory-theoretic approach
- Minimal fuzzy realization for fuzzy behaviour: a bicategory-theoretic approach
- Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them
- Categories of quantale-valued fuzzy automata: determinization and minimization
- A categorical approach to minimal realization for a fuzzy language
- Formal power series and regular operations on fuzzy languages
- Minimizing deterministic lattice automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Algebraic properties of \(L\)-fuzzy finite automata
- Fuzzy \(\varepsilon\)-subgroups.
- Fuzzy alternating automata over distributive lattices
- On closure properties of \(\mathcal{L}\)-valued linear languages
- Coding tree languages based on lattice-valued logic
- Fuzzy identities with application to fuzzy semigroups.
- Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
- A generalization of Myhill-Nerode theorem for fuzzy languages
- Grammar theory based on lattice-ordered monoid
This page was built for publication: Minimization of lattice finite automata and its application to the decomposition of lattice languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372275)
