EUDML | Some algorithms to compute the conjugates of episturmian morphisms

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Some algorithms to compute the conjugates of episturmian morphisms”

About the decision of reachability for register machines

Véronique Cortier (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We study the decidability of the following problem: given $p$ affine functions $f_{1}, ..., f_{p}$ over $ℕ^{k}$ and two vectors $v_{1}, v_{2} \in ℕ^{k}$ , is $v_{2}$ reachable from $v_{1}$ by successive iterations of $f_{1}, ..., f_{p}$ (in this given order)? We show that this question is decidable for $p = 1, 2$ and undecidable for some fixed $p$ .

Polynomial complexity of the Gilman-Maskit discreteness algorithm.

Jiang, Yicheng (2001)

Annales Academiae Scientiarum Fennicae. Mathematica

Similarity:

Some properties of the singular words of the Fibonacci word.

Wen, Zhixiong, Wen, Zhi-Ying (1993)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

A bijective proof of $f_{n + 4} + f_{1} + 2 f_{2} + \dots + n f_{n} = (n + 1) f_{n + 2} + 3$ .

Matchett Wood, Philip (2006)

Integers

Similarity:

Some remarks on the equation $F [n] = k F [m]$ in Fibonacci numbers.

Farrokhi D.G., M. (2007)

Journal of Integer Sequences [electronic only]

Similarity:

Addition of initial segments. II.

Antonín Sochor (1988)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Endomorphic cuts and tails

Karel Čuda, Athanossios Tzouvaras (1987)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

A problem on the zeros of the Mittag-Leffler function and the spectrum of a fractional-order differential operator.

Aleroev, T.S., Aleroeva, H.T. (2009)

Electronic Journal of Qualitative Theory of Differential Equations [electronic only]

Similarity: