Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
INFOCOM
2011
IEEE
10 years 5 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
ARC
2011
Springer
270views Hardware» more  ARC 2011»
10 years 8 months ago
A Regular Expression Matching Circuit Based on a Decomposed Automaton
In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura
ENGL
2007
87views more  ENGL 2007»
11 years 1 months ago
Learning of Partial Languages
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
K. Sasikala, V. Rajkumar Dare, D. G. Thomas
STACS
2004
Springer
11 years 6 months ago
Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
Alberto Bertoni, Christian Choffrut, Massimiliano ...
books