Sciweavers

227 search results - page 13 / 46
» P Systems and Finite Automata
Sort
View
ANCS
2009
ACM
13 years 7 months ago
A NFA-based programmable regular expression match engine
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
Derek Pao
CADE
2009
Springer
14 years 10 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
NC
2008
126views Neural Networks» more  NC 2008»
13 years 9 months ago
Spiking neural P systems with extended rules: universality and languages
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj,...
SIAMCO
2000
90views more  SIAMCO 2000»
13 years 9 months ago
Finite-Time Stability of Continuous Autonomous Systems
Finite-time stability is defined for equilibria of continuous but non-Lipschitzian autonomous systems. Continuity, Lipschitz continuity, and H
Sanjay P. Bhat, Dennis S. Bernstein
SIAMCO
2000
79views more  SIAMCO 2000»
13 years 9 months ago
A Twofold Spline Approximation for Finite Horizon LQG Control of Hereditary Systems
In this paper an approximation scheme is developed for the solution of the Linear Quadratic Gaussian (LQG) control on a
Alfredo Germani, Costanzo Manes, P. Pepe