Deterministic Acceptors of Regular Fuzzy Languages
From MaRDI portal
Cited in
(25)- Fuzzy automaton induction using neural network
- Fuzzy Regular Languages Based on Residuated Lattice
- Fuzzy complete sets
- Properties of restricted cascade product of fuzzy finite state machines
- Approximation and universality of fuzzy Turing machines
- On characterization of fuzzy tree pushdown automata
- Approximation of fuzzy context-free grammars
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- New directions in fuzzy automata
- Regular grammars with truth values in lattice-ordered monoid and their languages
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
- Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata
- Cut sets as recognizable tree languages
- State hyperstructures of tree automata based on lattice-valued logic
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Fuzzy automata with -moves compute fuzzy measures between strings
- Algebraic properties of \(LA\)-languages
- A formal power series approach to the construction of minimal fuzzy automata
- The relationships among several types of fuzzy automata
- Determinization of fuzzy automata via factorization of fuzzy states
- scientific article; zbMATH DE number 1506930 (Why is no real title available?)
- BL-general fuzzy automata and minimal realization: based on the associated categories
- A comment on ``Construction of fuzzy automata from fuzzy regular expressions
This page was built for publication: Deterministic Acceptors of Regular Fuzzy Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4103035)
