The central question of this paper is: are deterministic and indeterministic descriptions observationally equivalent in the sense that they give the same predictions? I tackle this question for measuretheoretic deterministic systems and stochastic processes, both of which are ubiquitous in science. I first show that for many measure-theoretic deterministic systems there is a stochastic process ...

A. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS ’08, pages 669–680) by devising a deterministic approach whose performance guarantee is 4.91 + ε. In addition, we study preemptive online algorithms, a sub-class of one-pass algorithms where we are only allowed to maintain a feasible ...

We characterize the infinite words determined by one-way stack automata. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We extend this result to the class of languages recognized by one-way nondeterministic checking stack automata (1-NCSA). We then consider stronger clas...

In this paper, we show how to construct secure obfuscation for Deterministic Finite Automata, assuming non-uniformly strong one-way functions exist. We revisit the software protection approaches originally proposed by [5, 10, 12, 17] and revise them to the current obfuscation setting of Barak et al. [2]. Under this model, we introduce an efficient oracle that retains some “small” secret about t...

Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Cerny in 2010 as a one-way deterministic automata model to define transformations of finite strings. Copyless SST extend deterministic finite state automata with a set of registers in which to store intermediate output strings, and those registers can be combined and updated all along the run, in a linea...

The alternating model augmented by a special simple form of communication among parallel processes-the so-called synchronized alternating (SA) model, provides (besides others) nice characterizations of the space complexity classes deened by nondeterministic Turing machines. The model investigated in this paper { globally deterministic synchronized alternating (GDSA) model, is obtained by a feas...

We introduce new techniques for proving quadratic lower bounds for deterministic and nondeterministic 1-tape Turing machines (all considered Turing machines have an additional one-way input tape). In particular, we derive for the simulation of 2-tape Turing machines by 1-tape Turing machines an optimal quadratic lower bound in the deterministic case and a nearly optimal lower bound in the nonde...

This paper is concerned with a subclass of deterministic pushdown transducers, called deterministic restricted one-counter transducers (droct’s), and studies the inclusion problem for droct’s which accept by final state. In the previous study, we presented a polynomialtime algorithm for checking the equivalence of these droct’s. By extending this technique, we present a polynomial-time algorith...