Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids

From MaRDI portal

Revision as of 11:06, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:812560

Jump to:navigation, search

DOI10.1016/J.FSS.2005.04.004zbMath1083.68059OpenAlexW1975037151WikidataQ62038255 ScholiaQ62038255MaRDI QIDQ812560

Witold Pedrycz, Yong-Ming Li

Publication date: 24 January 2006

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2005.04.004

zbMATH Keywords

closure property fuzzy language level structure fuzzy finite automaton fuzzy regular expression lattice-order monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (only showing first 100 items - show all)

IT-2 Fuzzy Automata and IT-2 Fuzzy Languages ⋮ TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES ⋮ Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure ⋮ The universal fuzzy automaton ⋮ Weak bisimulations for fuzzy automata ⋮ Brzozowski type determinization for fuzzy automata ⋮ Weighted synchronous 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 ⋮ Fuzzy identities with application to fuzzy semigroups. ⋮ On intuitionistic fuzzy context-free languages ⋮ Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata ⋮ Interval type-2 fuzzy automata and interval type-2 fuzzy grammar ⋮ Intuitionistic fuzzy transformation semigroups ⋮ Approximation of fuzzy context-free grammars ⋮ Weighted finite automata over strong bimonoids ⋮ Similarity-based minimization of fuzzy tree automata ⋮ Fuzzy \(\varepsilon\)-subgroups. ⋮ Unnamed Item ⋮ On the recognizability of fuzzy languages. I ⋮ Minimization of states in automata theory based on finite lattice-ordered monoids ⋮ Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness ⋮ Intuitionistic general fuzzy automata ⋮ Normal Ω-subgroups ⋮ \(E\)-fuzzy groups ⋮ Fuzzy alternating Büchi automata over distributive lattices ⋮ On quotients of formal power series ⋮ Fuzzy grammar theory based on lattices ⋮ On the category of \(L\)-fuzzy automata, coalgebras and dialgebras ⋮ On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations ⋮ Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects ⋮ Quantitative model checking of linear-time properties based on generalized possibility measures ⋮ Information retrieval from interval-valued fuzzy automata through \(K_\alpha\) operators ⋮ Automata theory based on lattice-ordered semirings ⋮ Bisimulations for fuzzy automata ⋮ A new algorithm for testing diagnosability of fuzzy discrete event systems ⋮ Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders ⋮ Finite automata theory with membership values in lattices ⋮ Applications of a group in general fuzzy automata ⋮ Fuzzy multiset finite automata and their languages ⋮ Algebraic properties of \(L\)-fuzzy finite automata ⋮ Introducing synchrony in fuzzy automata ⋮ Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures ⋮ Conversion of fuzzy automata into fuzzy regular expressions using transitive closure ⋮ On a category of fuzzy automata with relations ⋮ Minimal realization for fuzzy behaviour: A bicategory-theoretic approach ⋮ Weak Second‐Order Arithmetic and Finite Automata ⋮ Algebraic properties on the cuts of lattice-valued regular languages ⋮ An Improved Proof of the Closure Under Homomorphic Inverse of FCFL Valued in Lattice-Ordered Monoids ⋮ FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE ⋮ Determinization of fuzzy automata with membership values in complete residuated lattices ⋮ DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA ⋮ Determinization of fuzzy automata via factorization of fuzzy states ⋮ Logical characterizations of simulation and bisimulation for fuzzy transition systems ⋮ Further improvements of determinization methods for fuzzy finite automata ⋮ On equality between fuzzy context-free and fuzzy adult 0L languages ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices ⋮ Approximation and universality of fuzzy Turing machines ⋮ The relationship of controllability between classical and fuzzy discrete-event systems ⋮ Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization ⋮ Lattice-valued finite state machines and lattice-valued transformation semigroups ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Computation tree logic model checking based on possibility measures ⋮ A comment on ``Construction of fuzzy automata from fuzzy regular expressions ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ IF-topologies and IF-automata ⋮ Unnamed Item ⋮ A categorical approach to lattice-valued fuzzy automata ⋮ Fuzzy regular languages over finite and infinite words ⋮ Formal power series and regular operations on fuzzy languages ⋮ Approximation and robustness of fuzzy finite automata ⋮ Nondeterministic fuzzy automata ⋮ Automata theory based on complete residuated lattice-valued logic: Reduction and minimization ⋮ Fuzzy relation equations and reduction of fuzzy automata ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ Products of lattice-valued fuzzy transition systems and induced fuzzy transformation semigroups ⋮ Model checking of linear-time properties in multi-valued systems ⋮ Reduction of fuzzy automata by means of fuzzy quasi-orders ⋮ Algebraic properties of \(LA\)-languages ⋮ On minimal realization of fuzzy behaviour and associated categories ⋮ Conditions for the existence of maximal factorizations ⋮ A categorical approach to minimal realization for a fuzzy language ⋮ Approximate bisimulation relations for fuzzy automata ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ Categories of quantale-valued fuzzy automata: determinization and minimization ⋮ On \(L^M\)-valued automata: an operator oriented view ⋮ Grammar theory based on lattice-ordered monoid ⋮ Fuzzy homomorphisms of algebras ⋮ Lattice-valued fuzzy Turing machines: computing power, universality and efficiency ⋮ Fuzzy alternating automata over distributive lattices ⋮ Canonization of max-min fuzzy automata ⋮ Categories of Automata and Languages Based on a Complete Residuated Lattice ⋮ Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices ⋮ Bipolar Fuzzy Preorder, Alexandrov Bipolar Fuzzy Topology and Bipolar Fuzzy Automata ⋮ Measure of Operators Associated with Fuzzy Automata ⋮ Construction of a minimal realization and monoid for a fuzzy language: a categorical approach ⋮ Fuzzy state grammar and fuzzy deep pushdown automaton ⋮ On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization

Cites Work

This page was built for publication: Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:812560&oldid=12745270"