Fuzzy automata and languages

From MaRDI portal
Publication:1229840

DOI10.1016/S0020-0255(76)90818-5zbMath0336.94040OpenAlexW2019964946MaRDI QIDQ1229840

K. Appert

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/s0020-0255(76)90818-5



Related Items

Weak bisimulations for 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, Interval type-2 fuzzy automata and interval type-2 fuzzy grammar, Approximation of fuzzy context-free grammars, FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION, Fuzzy language on free monoid, Bisimulations for fuzzy automata, Unnamed Item, The lattice-valued Turing machines and the lattice-valued type 0 grammars, Algebraic properties of \(L\)-fuzzy finite automata, On a category of fuzzy automata with relations, An Improved Proof of the Closure Under Homomorphic Inverse of FCFL Valued in Lattice-Ordered Monoids, Results on the use of category theory for the study of lattice-valued finite state machines, On equality between fuzzy context-free and fuzzy adult 0L languages, Computation of the greatest simulations and bisimulations between fuzzy automata, Construction of fuzzy automata from fuzzy regular expressions, Myhill-Nerode type theory for fuzzy languages and automata, An algorithm of test for fuzzy codes, Nondeterministic fuzzy automata, The relationships among several types of fuzzy automata, Algebraic properties of \(LA\)-languages, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids, Categories of Automata and Languages Based on a Complete Residuated Lattice, Algebraic aspects of families of fuzzy languages, Regular grammars with truth values in lattice-ordered monoid and their languages



Cites Work