Related papers: Weak Cost Register Automata are Still Powerful
A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it…
Auto-active program verification rests on the ability to effectively the translation from annotated programs into verification conditions that are then discharged by automated theorem provers in the background. Characteristic such tools,…
We discuss the recently introduced concept of non-deterministic noiseless linear amplification, demonstrating that such an operation can only be performed perfectly with vanishing probability of success. We show that a weak measurement,…
This paper investigates the (conditional) quasi-likelihood ratio test for the threshold in MA models. Under the hypothesis of no threshold, it is shown that the test statistic converges weakly to a function of the centred Gaussian process.…
Additive Cost Register Automata (ACRA) map strings to integers using a finite set of registers that are updated using assignments of the form "x := y + c" at every step. The corresponding class of additive regular functions has multiple…
The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise conjunction, although equally supported by computing hardware,…
In this paper we present lightweight record-and-replay (RR). In contrast to traditional "fully deterministic" RR solutions, lightweight RR focuses on handling nondeterminism arising from thread communication for programs with concurrent,…
We investigate the complexity of the containment problem "Does $L(A)\subseteq L(B)$ hold?", where $B$ is an unambiguous register automaton and $A$ is an arbitrary register automaton. We prove that the problem is decidable and give upper…
We consider formal verification of recursive programs with resource consumption. We introduce prefix replacement systems with non-negative integer counters which can be incremented and reset to zero as a formal model for such programs. In…
We prove continuity of certain cost functions arising from optimal control of affine control systems. We give sharp sufficient conditions for this continuity. As an application, we prove a version of weak KAM theorem and consider the…
We present a framework for minimizing costs in constant weight codes while maintaining a certain amount of differentiable codewords. Our calculations are based on a combinatorial view of constant weight codes and relay on simple…
Many safety-critical real-time systems operate under harsh environment and are subject to soft errors caused by transient or intermittent faults. It is critical and yet often very challenging to apply fault tolerance techniques in these…
It is well known that the minimal superhedging price of a contingent claim is too high for practical use. In a continuous-time model uncertainty framework, we consider a relaxed hedging criterion based on acceptable shortfall risks.…
This paper extends validity of the conditional likelihood ratio (CLR) test developed by Moreira (2003) to instrumental variable regression models with unknown error variance and many weak instruments. In this setting, we argue that the…
We prove mixed weak estimates of Sawyer type for fractional operators. More precisely, let $\mathcal{T}$ be either the maximal fractional function $M_\gamma$ or the fractional integral operator $I_\gamma$, $0<\gamma<n$, $1\leq p<n/\gamma$…
A weakly constrained code is a collection of finite-length strings over a finite alphabet in which certain substrings or patterns occur according to some prescribed frequencies. Buzaglo and Siegel (ITW 2017) gave a construction of weakly…
We present a technique to infer lower bounds on the worst-case runtime complexity of integer programs, where in contrast to earlier work, our approach is not restricted to tail-recursion. Our technique constructs symbolic representations of…
We examine a model of classical deterministic computing in which the ground state of the classical system is a spatial history of the computation. This model is relevant to quantum dot cellular automata as well as to recent universal…
The tropical semiring is an algebraic system with addition ``$\max$'' and multiplication ``$+$''. As well as in conventional algebra, linear programming in the tropical semiring has been developed. In this study, we introduce a new type of…
The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \textless{} n/2 (where t is…