Sciweavers

101 search results - page 3 / 21
» General Algorithms for Testing the Ambiguity of Finite Autom...
Sort
View
COLT
1995
Springer
13 years 11 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
CONEXT
2007
ACM
13 years 11 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
SAC
2010
ACM
14 years 19 days ago
Of mice and terms: clustering algorithms on ambiguous terms in folksonomies
Developed using the principles of the Model-View-Controller architectural pattern, FolksEngine is a parametric search engine for folksonomies that allows us to test arbitrary sear...
Nicola Raffaele Di Matteo, Silvio Peroni, Fabio Ta...
ICES
2000
Springer
140views Hardware» more  ICES 2000»
13 years 11 months ago
Evolving Cellular Automata for Self-Testing Hardware
Testing is a key issue in the design and production of digital circuits: the adoption of BIST (Built-In Self-Test) techniques is increasingly popular, but requires efficient algori...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 7 months ago
A proof Procedure for Testing Membership in Regular Expressions
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Keehang Kwon, Hong Pyo Ha, Jiseung Kim