227 search results - page 5 / 46 » P Systems and Finite Automata |
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
NC
2010
13 years 8 months ago
2010
Abstract. Inspired by P systems initiated by Gheorghe P˜aun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of fini...
ACTAC
2006
13 years 10 months ago
2006
The algebraic hierarchical decomposition of finite state automata can be applied wherever a finite system should be `understood' using a hierarchical coordinate system. Here ...
TNN
2010
13 years 4 months ago
2010
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...
CASES
2006
ACM
14 years 1 months ago
2006
ACM
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 ...