Scientific workflow systems are increasingly used to automate complex data analyses,
largely due to their benefits over traditional approaches for workflow design, optimization …

Streams are preferable over data stored in memory in contexts where data is too large or
volatile, or a standard approach to data processing based on storing is too time or space …

There has been much work on synthesizing and repairing regular expressions (regexes for
short) from examples. These programming-by-example (PBE) methods help the users write …

We study deterministic regular expressions extended with the counting operator. There exist
two notions of determinism, strong and weak determinism, which are equally expressive for …

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 …

In this paper, we first present characterizations of weak determinism for regular expressions
with counting, based on which we develop an O (| Σ E|| E|) time algorithm to check whether …

Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs)
that extends finite state transducers with a stack. Like visibly pushdown automata, the input …

We study deterministic regular expressions extended with the counting operator. There exist
two notions of determinism, strong and weak determinism, which almost coincide for …

We study the membership problem for regular expressions extended with operators for
unordered concatenation and numerical constraints. The unordered concatenation of a set …

A linear time algorithm is presented for testing determinism of a regular expression. It is
shown that an input word of length n can be matched against a deterministic regular …