141 search results - page 16 / 29 » An Algorithm for Transformation of Finite Automata to Regula... |
CCR
2010
13 years 6 months ago
2010
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
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...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many ...
CONCUR
2006
Springer
13 years 10 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
DLT
2009
13 years 6 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...