Displaying similar documents to “Computing the prefix of an automaton”

On-line finite automata for addition in some numeration systems

Christiane Frougny (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We consider numeration systems where the base is a negative integer, or a complex number which is a root of a negative integer. We give parallel algorithms for addition in these numeration systems, from which we derive on-line algorithms realized by finite automata. A general construction relating addition in base and addition in base is given. Results on addition in base β = b m , where is a relative integer, follow. We also show that addition in base the golden ratio is computable...

Méthodes géométriques et analytiques pour étudier l'application exponentielle, la sphère et le front d'onde en géométrie sous-riemannienne dans le cas Martinet

Bernard Bonnard, Monique Chyba (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Consider a sub-riemannian geometry (U,D,g) where U is a neighborhood of 0 in R 3, D is a Martinet type distribution identified to ker ω, ω being the 1-form: ω = d z - y 2 2 d x , q=(x,y,z) and g is a metric on D which can be taken in the normal form:...

Minimax nonparametric hypothesis testing for ellipsoids and Besov bodies

Yuri I. Ingster, Irina A. Suslina (2010)

ESAIM: Probability and Statistics

Similarity:

We observe an infinitely dimensional Gaussian random vector where is a sequence of standard Gaussian variables and is an unknown mean. We consider the hypothesis testing problem alternatives H ε , τ : v ∈ V ε for the sets V ε = V ε ( τ , ρ ε ) ⊂ l 2 . The sets are -ellipsoids of semi-axes with -ellipsoid of semi-axes removed or similar Besov bodies with Besov bodies removed. Here τ = ( κ , R ) or τ = ( κ , h , t , R ) ; κ = ( p , q , r , s ) are the parameters which define the sets for given radii , 0 < ; is the asymptotical...

About the decision of reachability for register machines

Véronique Cortier (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We study the decidability of the following problem: given  affine functions ƒ,...,ƒ over ℕ k and two vectors v 1 , v 2 ∈ ℕ k , is reachable from by successive iterations of ƒ,...,ƒ (in this given order)? We show that this question is decidable for and undecidable for some fixed .