Result 1 to 20 of 96 total
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms. (English)
Theor. Comput. Sci. 428, 92-97 (2012).
1
On primary and secondary repetitions in words. (English)
Theor. Comput. Sci. 418, 71-81 (2012).
2
Some improvements of the $S$-adic conjecture. (English)
Adv. Appl. Math. 48, No. 1, 79-98 (2012).
3
Cobham’s theorem for substitutions. (English)
J. Eur. Math. Soc. (JEMS) 13, No. 6, 1799-1814 (2011).
4
Regularity of a function related to the 2-adic logarithm. (English)
Bull. Belg. Math. Soc. - Simon Stevin 18, No. 2, 375-377 (2011).
5
Thue-Morse at multiples of an integer. (English)
J. Number Theory 131, No. 8, 1498-1512 (2011).
6
Algebraic combinatorics on words. With preface by Jean Berstel and Dominique Perrin. Reprint of the 2002 hardback ed. (English)
Encyclopedia of Mathematics and Its Applications 90. Cambridge: Cambridge University Press (ISBN 978-0-521-18071-9/pbk). xiii, 504~p. \sterling~35.00; \$~60.00 (2011).
7
Binary sequences generated by sequences $\{nα\}$, $n=1,2,\dots$. (English)
Publ. Math. 77, No. 1-2, 139-170 (2010).
8
Bounds for the discrete correlation of infinite sequences on $k$ symbols and generalized Rudin‒Shapiro sequences. (English)
Acta Arith. 140, No. 4, 345-368 (2009).
9
Irrationality measures for some automatic real numbers. (English)
Math. Proc. Camb. Philos. Soc. 147, No. 3, 659-678 (2009).
10
Christoffel words and Markoff triples. (English)
Integers 9, No. 3, 327-332, A26 (2009).
11
Aperiodicity measure for infinite sequences. (English)
Frid, Anna (ed.) et al., Computer science ‒ theory and applications. Fourth international computer science symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03350-6/pbk). Lecture Notes in Computer Science 5675, 274-285 (2009).
12
Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms. (English)
J. Symb. Comput. 44, No. 7, 726-767 (2009).
13
Words and transcendence. (English)
Chen, W. W. L. (ed.) et al., Analytic number theory. Essays in honour of Klaus Roth on the occasion of his 80th birthday. Cambridge: Cambridge University Press (ISBN 978-0-521-51538-2/hbk). 449-470 (2009).
14
On inversive congruential generator for pseudorandom numbers with prime power modulus. (English)
Ann. Univ. Sci. Budap. Rolando Eőtvős, Sect. Comput. 29, 277-296 (2008).
15
Drunken man infinite words complexity. (English)
Theor. Inform. Appl. 42, No. 3, 599-613 (2008).
16
A two-parameter family of an extension of Beatty sequences. (English)
Discrete Math. 308, No. 20, 4578-4588 (2008).
17
The Hamming weight of the non-adjacent-form under various input statistics. (English)
Period. Math. Hung. 55, No. 1, 81-96 (2007).
18
On a conjecture of McIntosh regarding LP-sequences. (English)
Int. J. Number Theory 3, No. 4, 599-610 (2007).
19
Combinatorics of recurrent words of complexity $n+2$. (Combinatoire de mots récurrents de complexité $n+2$.) (French)
Theor. Inform. Appl. 41, No. 4, 425-446 (2007).
20
Result 1 to 20 of 96 total
Start
Contact
Print
General Help
