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.003zbMath1123.68063OpenAlexW2080187126WikidataQ62038234 ScholiaQ62038234MaRDI QIDQ2372275
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
accessibilityfuzzy finite automatonfuzzy regular languagecoaccessibilityfuzzy unitary and fuzzy prefix language
Related Items
The universal fuzzy automaton, Brzozowski type determinization for fuzzy automata, A note on cut-worthiness of recognizable tree series, Fuzzy identities with application to fuzzy semigroups., Weighted finite automata over strong bimonoids, Decidability of the minimization of fuzzy tree automata with membership values in complete lattices, Fuzzy \(\varepsilon\)-subgroups., Unnamed Item, State hyperstructures of tree automata based on lattice-valued logic, Algebraic properties of complete residuated lattice valued tree automata, On closure properties of \(\mathcal{L}\)-valued linear languages, Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them, Bisimulations for fuzzy automata, Finite automata theory with membership values in lattices, Coding tree languages based on lattice-valued logic, Algebraic properties of \(L\)-fuzzy finite automata, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures, On minimal realization for a fuzzy language and Brzozowski’s algorithm, Minimal realization for fuzzy behaviour: A bicategory-theoretic approach, Determinization of fuzzy automata with membership values in complete residuated lattices, A generalization of Myhill-Nerode theorem for fuzzy languages, Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization, Construction of fuzzy automata from fuzzy regular expressions, Characterizations of complete residuated lattice-valued finite tree automata, Myhill-Nerode type theory for fuzzy languages and automata, Formal power series and regular operations on fuzzy languages, Automata theory based on complete residuated lattice-valued logic: Reduction and minimization, Model checking of linear-time properties in multi-valued systems, A categorical approach to minimal realization for a fuzzy language, Minimizing Deterministic Lattice Automata, Categories of quantale-valued fuzzy automata: determinization and minimization, TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS, Grammar theory based on lattice-ordered monoid, Lattice-valued fuzzy Turing machines: computing power, universality and efficiency, Fuzzy alternating automata over distributive lattices
Cites Work
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Equivalence, reduction and minimization of finite fuzzy-automata
- Fuzzy automata and languages
- On quotient machines of a fuzzy automaton and the minimal machine
- Fuzzy language on free monoid
- On fuzzy regular languages
- Semigroup homomorphisms and fuzzy automata
- Minimization algorithm of fuzzy finite automata.
- Minimization of fuzzy finite automata
- Determinism and fuzzy automata
- Fuzzy recognizers and recognizable sets
- Algebraic aspects of families of fuzzy languages
- A categorical approach to lattice-valued fuzzy automata
- Max-product machines
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Fuzzy discrete structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
