Myhill-Nerode type theory for fuzzy languages and automata
From MaRDI portal
Publication:969583
DOI10.1016/j.fss.2009.06.007zbMath1202.68261OpenAlexW2016220393MaRDI QIDQ969583
Miroslav Ćirić, Jelena Ignjatović, Stojan Bogdanović, Tatjana Petković
Publication date: 7 May 2010
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2009.06.007
fuzzy automatonfuzzy languageMyhill-Nerode theoremsyntactic monoiddeterministic automatonminimal automatonderivative automatonMyhill's automatonNerode's automaton
Related Items
BL-general fuzzy automata and minimal realization: Based on the associated categories, IT-2 Fuzzy Automata and IT-2 Fuzzy Languages, Pseudovarieties of algebras with fuzzy equalities., TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES, Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure, Weak bisimulations for fuzzy automata, Brzozowski type determinization for fuzzy automata, Unnamed Item, Laws of the lattices of \(\sigma \)-local formations of finite groups, Algebraic Myhill-Nerode theorems, On the category of \(L\)-fuzzy automata, coalgebras and dialgebras, On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization, On closure properties of \(\mathcal{L}\)-valued linear languages, Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Bisimulations for fuzzy automata, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, Weighted Automata over Vector Spaces, Algebraic lattices of solvably saturated formations and their applications, On minimal realization for a fuzzy language and Brzozowski’s algorithm, On a category of fuzzy automata with relations, Minimal realization for fuzzy behaviour: A bicategory-theoretic approach, 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, Further improvements of determinization methods for fuzzy finite automata, A generalization of Myhill-Nerode theorem for fuzzy languages, 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, A remark on Myhill-Nerode theorem for fuzzy languages, An improved algorithm for determinization of weighted and fuzzy automata, Determinization of weighted finite automata over strong bimonoids, Products of lattice-valued fuzzy transition systems and induced fuzzy transformation semigroups, Reduction of fuzzy automata by means of fuzzy quasi-orders, On minimal realization of fuzzy behaviour and associated categories, A categorical approach to minimal realization for a fuzzy language, Categories of quantale-valued fuzzy automata: determinization and minimization, On \(L^M\)-valued automata: an operator oriented view, 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, The Relationship Among Fuzzy Languages, Upper Sets and Fuzzy Ordered Monoids, Measure of Operators Associated with Fuzzy Automata, Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata theory based on quantum logic: Some characterizations
- The algebra of fuzzy truth values
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Congruences and homomorphisms of fuzzy automata
- Regular grammars with truth values in lattice-ordered monoid and their languages
- On the recognizability of fuzzy languages. II
- A note on cut-worthiness of recognizable tree series
- On the recognizability of fuzzy languages. I
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- The equivalence between fuzzy Mealy and fuzzy Moore machines
- Minimization of states in automata theory based on finite lattice-ordered monoids
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Algebraic properties on the cuts of lattice-valued regular languages
- Fuzzy relation equations and reduction of fuzzy automata
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- Grammar theory based on lattice-ordered monoid
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- Fuzzy automata and languages
- Products of fuzzy finite state machines
- Equality relations as a basis for fuzzy control
- On quotient machines of a fuzzy automaton and the minimal machine
- Fuzzy language on free monoid
- On fuzzy regular languages
- Fuzzy semigroups.
- Minimization algorithm of fuzzy finite automata.
- Automata theory based on quantum logic. I
- Minimization of fuzzy finite automata
- Topological properties of the class of generators of an indistinguishability operator
- Determinism and fuzzy automata
- Algebraic aspects of families of fuzzy languages
- Fuzzy groups, fuzzy functions and fuzzy equivalence relations.
- Unary algebras, semigroups and congruences on free semigroups
- Approximation and robustness of fuzzy finite automata
- Fuzzy equivalence relations and their equivalence classes
- 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
- Weighted automata and weighted logics
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- A categorical approach to lattice-valued fuzzy automata
- Cut sets as recognizable tree languages
- The relationships among several types of fuzzy automata
- Algebraic properties of \(LA\)-languages
- Max-product machines
- A theory of computation based on quantum logic. I
- Sequential Functions
- Linear Automaton Transformations
- Factorization of Fuzzy Automata
- Myhill-Nerode Theorem for Recognizable Tree Series Revisited
- On Correspondences Between Unary Algebras, Automata, Semigroups and Congruences
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Fuzzy equational logic
- Automata theory based on quantum logic. II.