Equivalence in automata theory based on complete residuated lattice-valued logic

From MaRDI portal
Publication:2372274

DOI10.1016/j.fss.2007.01.008zbMath1152.68463OpenAlexW2018492626WikidataQ62049458 ScholiaQ62049458MaRDI QIDQ2372274

Zhujun Fan, Hongyan Xing, Fuchun Liu, Dao Wen Qiu

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.01.008




Related Items

Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedureWeak bisimulations for fuzzy automataDecidability of the minimization of fuzzy tree automata with membership values in complete latticesState hyperstructures of tree automata based on lattice-valued logicAlgebraic properties of complete residuated lattice valued tree automataOn closure properties of \(\mathcal{L}\)-valued linear languagesOn the greatest solutions to weakly linear systems of fuzzy relation inequalities and equationsFuzzy automata based on lattice-ordered monoid with algebraic and topological aspectsBisimulations for fuzzy automataCoding tree languages based on lattice-valued logicMinimal realization for fuzzy behaviour: A bicategory-theoretic approachDeterminization of fuzzy automata with membership values in complete residuated latticesDeterminization of fuzzy automata via factorization of fuzzy statesFurther improvements of determinization methods for fuzzy finite automataComputing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimizationComputation of the greatest simulations and bisimulations between fuzzy automataConstruction of fuzzy automata from fuzzy regular expressionsCharacterizations of complete residuated lattice-valued finite tree automataA comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automataMyhill-Nerode type theory for fuzzy languages and automataUnnamed ItemFormal power series and regular operations on fuzzy languagesAutomata theory based on complete residuated lattice-valued logic: Reduction and minimizationFuzzy relation equations and reduction of fuzzy automataReduction of fuzzy automata by means of fuzzy quasi-ordersOn minimal realization of fuzzy behaviour and associated categoriesA categorical approach to minimal realization for a fuzzy languageWeighted finite automata with outputCategories of quantale-valued fuzzy automata: determinization and minimizationTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMSADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATONAutomata theory based on complete residuated lattice-valued logic: Pushdown automataPumping Lemma in context-free grammar theory based on complete residuated lattice-valued logicGrammar theory based on lattice-ordered monoidAutomata theory based on complete residuated lattice-valued logic: a categorical approachConstruction of a minimal realization and monoid for a fuzzy language: a categorical approach



Cites Work