Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513)
DOI: 10.1109/ccece.2004.1347583
|View full text |Cite
|
Sign up to set email alerts
|

Representing generalized fuzzy automata in recurrent neural networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…Accordingly, fuzzy finite automata have been applied in many areas, such as learning systems, the model of computing with words, pattern recognition, lattice-valued fuzzy finite automata, and clinical monitoring, and also used as models of machine learning systems (Ying, 2002;Li and Shi, 2000). In general, fuzzy automata have provided an attractive systematic way of generalizing discrete applications (Cattaneo et al, 1997;Doostfatemeh and Kremer, 2003;Reiter, 2002;Srivastava and Tiwari, 2002). Moreover, fuzzy automata developed capabilities that are hardly achievable by other tools (Ying, 2002).…”
Section: Introductionmentioning
confidence: 99%
“…Accordingly, fuzzy finite automata have been applied in many areas, such as learning systems, the model of computing with words, pattern recognition, lattice-valued fuzzy finite automata, and clinical monitoring, and also used as models of machine learning systems (Ying, 2002;Li and Shi, 2000). In general, fuzzy automata have provided an attractive systematic way of generalizing discrete applications (Cattaneo et al, 1997;Doostfatemeh and Kremer, 2003;Reiter, 2002;Srivastava and Tiwari, 2002). Moreover, fuzzy automata developed capabilities that are hardly achievable by other tools (Ying, 2002).…”
Section: Introductionmentioning
confidence: 99%
“…Automaton (or more precisely a finite state automaton) are the prime example of general computational systems over discrete spaces and have a long history both in theory and application (Thomas, 1990;Moghari, Zahedi, & Ameri, 2011). A finite state automaton is an appropriate tool for modeling systems and applications which can be realized as finite set of states and transition between them depending on some input strings (Doostfatemeh & Kremer, 2004). And, the behavior of discrete event system modeled by an automaton is described by the language generated by the automaton.…”
Section: Introductionmentioning
confidence: 99%