Sciweavers

Share
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
6 years 5 months ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters
ICC
2011
IEEE
237views Communications» more  ICC 2011»
7 years 3 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
FSMNLP
2009
Springer
8 years 1 months ago
Zulu: An Interactive Learning Competition
Abstract. Active language learning is an interesting task for which theoretical results are known and several applications exist. In order to better understand what the better stra...
David Combe, Colin de la Higuera, Jean-Christophe ...
CORR
2010
Springer
92views Education» more  CORR 2010»
8 years 3 months ago
The Complexity of Finding Reset Words in Finite Automata
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
Jörg Olschewski, Michael Ummels
FOSSACS
2008
Springer
8 years 4 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
CONEXT
2007
ACM
8 years 7 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
AII
1989
8 years 7 months ago
Inductive Inference, DFAs, and Computational Complexity
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
Leonard Pitt
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
8 years 7 months ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani
ICGI
1998
Springer
8 years 7 months ago
Learning Stochastic Finite Automata from Experts
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
Colin de la Higuera
ICDT
2003
ACM
106views Database» more  ICDT 2003»
8 years 8 months ago
Processing XML Streams with Deterministic Automata
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan ...
books