Minimization of states in automata theory based on finite lattice-ordered monoids
From MaRDI portal
Publication:865914
DOI10.1016/j.ins.2006.07.015zbMath1109.68058OpenAlexW2061537870WikidataQ62038236 ScholiaQ62038236MaRDI QIDQ865914
Publication date: 20 February 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2006.07.015
Related Items
The universal fuzzy automaton, Fuzzy identities with application to fuzzy semigroups., Decidability of the minimization of fuzzy tree automata with membership values in complete lattices, State hyperstructures of tree automata based on lattice-valued logic, Algebraic properties of complete residuated lattice valued tree automata, On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization, 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, Coding tree languages based on lattice-valued logic, From classic observability to a simple fuzzy observability for fuzzy discrete-event systems, Algebraic properties of \(L\)-fuzzy finite automata, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures, On minimal realization for a fuzzy language and Brzozowski’s algorithm, Algebraic and topological structures on factorizations of fuzzy sets1, Minimal realization for fuzzy behaviour: A bicategory-theoretic approach, Determinization of fuzzy automata with membership values in complete residuated lattices, Diagnosability of fuzzy discrete event systems, Further improvements of determinization methods for fuzzy finite automata, Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization, Construction of fuzzy automata from fuzzy regular expressions, Characterizations of complete residuated lattice-valued finite tree automata, Myhill-Nerode type theory for fuzzy languages and automata, Automata theory based on complete residuated lattice-valued logic: Reduction and minimization, Fuzzy relation equations and reduction of fuzzy automata, Reduction of fuzzy automata by means of fuzzy quasi-orders, A categorical approach to minimal realization for a fuzzy language, Weighted finite automata with output, Categories of quantale-valued fuzzy automata: determinization and minimization, TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS, Grammar theory based on lattice-ordered monoid
Cites Work
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- The equivalence between fuzzy Mealy and fuzzy Moore machines
- Automata theory based on complete residuated lattice-valued logic
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Equivalence, reduction and minimization of finite fuzzy-automata
- Equivalence, reduction and minimization of finite automata over semirings
- On quotient machines of a fuzzy automaton and the minimal machine
- Characterizations of fuzzy finite automata.
- Finite \(L\)-fuzzy machines.
- Minimization algorithm of fuzzy finite automata.
- Minimization of fuzzy finite automata
- The relationships among several types of fuzzy automata
- A formal power series approach to the construction of minimal fuzzy automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Fuzzy discrete structures
- Unnamed Item
- Unnamed Item
- Unnamed Item