Sciweavers

245 search results - page 6 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
IC
2004
13 years 9 months ago
Constructing Finite State Automata for High-Performance XML Web Services
This paper describes a validating XML parsing method based on deterministic finite state automata (DFA). XML parsing and validation is performed by a schema-specific XML parser th...
Robert van Engelen
TNN
2010
139views Management» more  TNN 2010»
13 years 2 months ago
Identification of finite state automata with a class of recurrent neural networks
A class of recurrent neural networks is proposed and proven to be capable of identifying any discrete-time dynamical system. The application of the proposed network is addressed in...
Sung Hwan Won, Iickho Song, Sun-Young Lee, Cheol H...
KDID
2004
132views Database» more  KDID 2004»
13 years 9 months ago
An Automata Approach to Pattern Collections
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
CASES
2006
ACM
13 years 11 months ago
State space reconfigurability: an implementation architecture for self modifying finite automata
Many embedded systems exhibit temporally and behaviorally disjoint behavior slices. When such behaviors are captured by state machines, the current design flow will capture it as ...
Ka-Ming Keung, Akhilesh Tyagi
SSPR
2000
Springer
13 years 11 months ago
Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
Mikel L. Forcada, Rafael C. Carrasco