Author:
Mérai László,Winterhof Arne
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference17 articles.
1. Allouche, J.-P.: Finite automata and arithmetic. Séminaire Lotharingien de Combinatoire (Gerolfingen, 1993), 1–18, Prépubl. Inst. Rech. Math. Av., 1993/34, Univ. Louis Pasteur, Strasbourg (1993)
2. Allouche, J.P., Shallit, J.: Automatic sequences. Theory, applications, generalizations. Cambridge University Press, Cambridge (2003)
3. Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C.G., Rödl, V.: Measures of pseudorandomness for finite sequences: typical values. Proc. Lond. Math. Soc. 95(3), 778–812 (2007)
4. Christol, G.: Ensembles presque periodiques k-reconnaissables. Theoret. Comput. Sci. 9, 141–145 (1979)
5. Christol, G., Kamae, T., Mendés France, M., Rauzy, G.: Suites algébriques, automates et substitutions. Bull. Soc. Math. France 108(4), 401–419 (1980)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献