Sciweavers

206 search results - page 23 / 42
» Regular Expressions into Finite Automata
Sort
View
ENTCS
2006
273views more  ENTCS 2006»
13 years 7 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
FSTTCS
2010
Springer
13 years 5 months ago
Expressiveness of streaming string transducers
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
Rajeev Alur, Pavol Cerný
LICS
2005
IEEE
14 years 1 months ago
Looping Caterpillars
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
Evan Goris, Maarten Marx
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 7 months ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
RAID
2010
Springer
13 years 5 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...