Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
Authors:
- Lihua WuLWLihua Wu
- Daowen QiuDaowen Qiu
- 1 June 2010
- journal article
- research article
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 161 (12) , 1635-1656
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Computing behavior of finite fuzzy machines – Algorithm and its application to reduction and minimizationInformation Sciences, 2008
- A note on Trillas' CHC modelsArtificial Intelligence, 2007
- The relationships among several types of fuzzy automata☆Information Sciences, 2006
- Toward a generalized theory of uncertainty (GTU)––an outlineInformation Sciences, 2005
- Equivalence in knowledge representation: automata, recurrent neural networks, and dynamical fuzzy systemsProceedings of the IEEE, 1999
- Fuzzy finite-state automata can be deterministically encoded into recurrent neural networksIEEE Transactions on Fuzzy Systems, 1998
- Equivalence, reduction and minimization of finite automata over semiringsTheoretical Computer Science, 1991
- A formal power series approach to the construction of minimal fuzzy automataInformation Sciences, 1991
- On Fuzzy Logic I Many‐valued rules of inferenceMathematical Logic Quarterly, 1979
- Abstract residuation over latticesBulletin of the American Mathematical Society, 1938