Sciweavers

303 search results - page 28 / 61
» Automata on Gauss Words
Sort
View
RAID
2010
Springer
13 years 8 months ago
Improving NFA-Based Signature Matching Using Ordered Binary Decision Diagrams
Network intrusion detection systems (NIDS) make extensive use of regular expressions as attack signatures. Internally, NIDS represent and operate these signatures using finite au...
Liu Yang, Rezwana Karim, Vinod Ganapathy, Randy Sm...
LICS
2009
IEEE
14 years 4 months ago
Expressiveness and Closure Properties for Quantitative Languages
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ICALP
2005
Springer
14 years 3 months ago
Weighted Automata and Weighted Logics
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
Manfred Droste, Paul Gastin
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
14 years 4 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
ICALP
2000
Springer
14 years 1 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen