Displaying similar documents to “Non-Looping String Rewriting”

A characterization of poly-slender context-free languages

Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

For a non-negative integer , we say that a language is if the number of words of length in is of order 𝒪 ( n k ) . We give a precise characterization of the -poly-slender context-free languages. The well-known characterization of the -poly-slender regular languages is an immediate consequence of ours.

Asymptotic behavior of the hitting time, overshoot and undershoot for some Lévy processes

Bernard Roynette, Pierre Vallois, Agnès Volpi (2007)

ESAIM: Probability and Statistics

Similarity:

Let () be a Lévy process started at , with Lévy measure . We consider the first passage time of () to level , and the overshoot and the undershoot. We first prove that the Laplace transform of the random triple () satisfies some kind of integral equation. Second, assuming that admits exponential moments, we show that ( T x ˜ , K x , L x ) converges in distribution as → ∞, where T x ˜ denotes a suitable renormalization of .