Deterministic Acceptors of Regular Fuzzy Languages

DOI10.1109/TSMC.1974.5409123zbMath0335.94030OpenAlexW2024469541MaRDI QIDQ4103035

Michael G. Thomason, Peter N. Marinos

Publication date: 1974

Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsmc.1974.5409123

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00)

Related Items (24)

BL-general fuzzy automata and minimal realization: Based on the associated categories ⋮ Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure ⋮ Equivalence in automata theory based on complete residuated lattice-valued logic ⋮ Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata ⋮ Approximation of fuzzy context-free grammars ⋮ Decidability of the minimization of fuzzy tree automata with membership values in complete lattices ⋮ A formal power series approach to the construction of minimal fuzzy automata ⋮ Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note ⋮ State hyperstructures of tree automata based on lattice-valued logic ⋮ Unnamed Item ⋮ Determinization of fuzzy automata via factorization of fuzzy states ⋮ Approximation and universality of fuzzy Turing machines ⋮ A comment on ``Construction of fuzzy automata from fuzzy regular expressions ⋮ On characterization of fuzzy tree pushdown automata ⋮ New directions in fuzzy automata ⋮ Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings ⋮ Cut sets as recognizable tree languages ⋮ Fuzzy automaton induction using neural network ⋮ 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 ⋮ Fuzzy complete sets ⋮ Fuzzy Regular Languages Based on Residuated Lattice ⋮ Regular grammars with truth values in lattice-ordered monoid and their languages

This page was built for publication: Deterministic Acceptors of Regular Fuzzy Languages