Sciweavers

7 search results - page 1 / 2
» Subsequence Automata with Default Transitions
Sort
View
ICGI
2010
Springer
13 years 9 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
CEC
2007
IEEE
14 years 5 months ago
Evolutionary search for cellular automata that exhibit self-organizing properties induced by external perturbations
— Cellular Automata (CAs) have been investigated extensively as abstract models of the distributed systems composed of autonomous entities characterized by local interaction. How...
Yusuke Iwase, Reiji Suzuki, Takaya Arita
GLOBECOM
2010
IEEE
13 years 8 months ago
Skip Finite Automaton: A Content Scanning Engine to Secure Enterprise Networks
Abstract--Today's file sharing networks are creating potential security problems to enterprise networks, i.e., the leakage of confidential documents. In order to prevent such ...
Junchen Jiang, Yi Tang, Bin Liu, Yang Xu, Xiaofei ...
SIGCOMM
2006
ACM
14 years 4 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
IJFCS
2007
105views more  IJFCS 2007»
13 years 10 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean