General formulation of sequential machines
From MaRDI portal
Cited in
(26)- Equivalence, reduction and minimization of finite fuzzy-automata
- Equivalence, reduction and minimization of finite automata over semirings
- Various kinds of automata with weights
- Finite L-fuzzy machines.
- Fuzzy recognizers and recognizable sets
- Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects
- Algebraic properties of intuitionistic \(L\)-fuzzy multiset finite automata
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
- Fuzzy automata with -moves compute fuzzy measures between strings
- Maximin sequential chains
- Some considerations on Fuzzy automata
- Maximin, Minimax, and composite sequential machines
- General formulation of formal grammars
- Max-product machines
- Continuously valued logic
- Soft finite state machine
- Homomorphisms of fuzzy recognizers
- Some structural complexities of time-varying sequential machines
- THE LOGIC OF AUTOMATA
- FUZZY‐FUZZY AUTOMATA
- Distinguishability and completeness of crisp deterministic fuzzy automata
- State hyperstructures of tree automata based on lattice-valued logic
- Maximin sequential-like machines and chains
- Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata
- The equivalence between fuzzy Mealy and fuzzy Moore machines
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
This page was built for publication: General formulation of sequential machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5544294)
