Bispecial Factors in the Brun S-Adic System
详细信息 查看全文
- 关键词：Substitutions ; Brun ; Factor complexity ; Bispecial
- 刊名：Lecture Notes in Computer Science
- 出版年：2016
- 出版时间：2016
- 年：2016
- 卷：9840
- 期：1
- 页码：280-292
- 全文大小：368 KB
- 参考文献：1.Akiyama, S., Barge, M., Berthé, V., Lee, J.Y., Siegel, A.: On the Pisot substitution conjecture. Preprint (2014)
2.Arnoux, P., Rauzy, G.: Représentation géométrique de suites de complexité 2n + 1. Bull. Soc. Math. Fr. 119(2), 199–215 (1991)MathSciNet MATH
3.Avila, A., Delecroix, V.: Some monoids of Pisot matrices. Preprint, June 2015. http://arXiv.org/abs/1506.03692
4.Berthé, V., Bourdon, J., Jolivet, T., Siegel, A.: A combinatorial approach to products of Pisot substitutions. Ergod. Theory Dyn. Syst. First View, 1–38. http://journals.cambridge.org/article_S0143385714001412
5.Berthé, V., Labbé, S.: Factor complexity of \(S\) -adic words generated by the Arnoux-Rauzy-Poincaré algorithm. Adv. Appl. Math. 63, 90–130 (2015)CrossRef MATH
6.Berthé, V., Rigo, M. (eds.): Combinatorics, Automata and Number Theory, Encyclopedia of Mathematics and its Applications, vol. 135. Cambridge University Press, Cambridge (2010)
7.Berthé, V., Steiner, W., Thuswaldner, J.M.: Geometry, dynamics, and arithmetic of \({S}\) -adic shifts. Preprint (2014). http://arXiv.org/abs/1410.0331
8.Brentjes, A.J.: Multidimensional Continued Fraction Algorithms. Mathematisch Centrum, Amsterdam (1981)MATH
9.Brun, V.: Algorithmes euclidiens pour trois et quatre nombres. In: Treizième congrès des mathèmaticiens scandinaves, tenu à Helsinki 18–23 août 1957, pp. 45–64. Mercators Tryckeri, Helsinki (1958)
10.Delecroix, V., Hejda, T., Steiner, W.: Balancedness of Arnoux-Rauzy and Brun words. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 119–131. Springer, Heidelberg (2013)CrossRef
11.Durand, F.: Corrigendum and addendum to: “Linearly recurrent subshifts have a finite number of non-periodic subshift factors”. Ergod. Theory Dyn. Syst. 23, 663–669 (2003)MathSciNet
12.Klouda, K.: Bispecial factors in circular non-pushy D0L languages. Theoret. Comput. Sci. 445, 63–74 (2012). http://dx.doi.org/10.1016/j.tcs.2012.05.007 MathSciNet CrossRef MATH
13.Lagarias, J.C.: The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms. Monatsh. Math. 115(4), 299–328 (1993). http://dx.doi.org/10.1007/BF01667310 MathSciNet CrossRef MATH
14.Morse, M., Hedlund, G.A.: Symbolic Dynamics II. Sturmian Trajectories. Am. J. Math. 62(1), 1–42 (1940). http://www.jstor.org/stable/2371431 MathSciNet CrossRef MATH
15.Rauzy, G.: Nombres algébriques et substitutions. Bulletin de la Société Mathématique de France 110, 147–178 (1982)MathSciNet MATH
16.Schratzberger, B.R.: The quality of approximation of Brun’s algorithm in three dimensions. Monatsh. Math. 134(2), 143–157 (2001). http://dx.doi.org/10.1007/s006050170004 MathSciNet CrossRef MATH
17.Schweiger, F.: Multidimensional Continued Fraction. Oxford University Press, New York (2000)MATH - 作者单位：Sébastien Labbé (15)
Julien Leroy (15)
15. Institut de Mathématique, Université de Liège, Allée de la découverte 12 (B37), 4000, Liège, Belgium - 丛书名：Developments in Language Theory
- ISBN：978-3-662-53132-7
- 刊物类别：Computer Science
- 刊物主题：Artificial Intelligence and Robotics
Computer Communication Networks
Software Engineering
Data Encryption
Database Management
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity - 出版者：Springer Berlin / Heidelberg
- ISSN：1611-3349
- 卷排序：9840
文摘
We study the bispecial factors in the S-adic system associated with the Brun Multidimensional Continued Fraction algorithm. More precisely, by describing how strong and weak bispecial words can appear, we get a sub-language of the Brun language for which all bispecial words are neutral.