General formulation of sequential machines
From MaRDI portal
Publication:5544294
DOI10.1016/S0019-9958(68)90123-XzbMath0162.02501MaRDI QIDQ5544294
William G. Wee, Eugene S. Santos
Publication date: 1968
Published in: Information and Control (Search for Journal in Brave)
Related Items (26)
Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata ⋮ Maximin sequential-like machines and chains ⋮ Decidability of the minimization of fuzzy tree automata with membership values in complete lattices ⋮ State hyperstructures of tree automata based on lattice-valued logic ⋮ The equivalence between fuzzy Mealy and fuzzy Moore machines ⋮ Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects ⋮ Equivalence, reduction and minimization of finite fuzzy-automata ⋮ Some structural complexities of time-varying sequential machines ⋮ Finite \(L\)-fuzzy machines. ⋮ Soft finite state machine ⋮ Equivalence, reduction and minimization of finite automata over semirings ⋮ THE LOGIC OF AUTOMATA ⋮ DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA ⋮ FUZZY‐FUZZY AUTOMATA ⋮ Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization ⋮ Homomorphisms of fuzzy recognizers ⋮ Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings ⋮ Various kinds of automata with weights ⋮ 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 ⋮ Algebraic properties of intuitionistic \(L\)-fuzzy multiset finite automata ⋮ Fuzzy recognizers and recognizable sets
This page was built for publication: General formulation of sequential machines
