Rukavicka, Josef Upper bound for palindromic and factor complexity of rich words. (English) Zbl 1508.68276 RAIRO, Theor. Inform. Appl. 55, Paper No. 1, 15 p. (2021). MSC: 68R15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Djukanovic, Marko; Raidl, Günther R.; Blum, Christian Anytime algorithms for the longest common palindromic subsequence problem. (English) Zbl 1458.68289 Comput. Oper. Res. 114, Article ID 104827, 20 p. (2020). MSC: 68W32 68Q25 68R15 68W05 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Glen, Amy; Simpson, Jamie; Smyth, W. F. Palindromes in starlike trees. (English) Zbl 1411.05232 Australas. J. Comb. 73, Part 1, 242-246 (2019). MSC: 05C78 05A05 05C05 68R15 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Brlek, Srečko; Lafrenière, Nadia; Provençal, Xavier Palindromic complexity of trees. (English) Zbl 1434.68380 Potapov, Igor (ed.), Developments in language theory. 19th international conference, DLT 2015, Liverpool, UK, July 27–30, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9168, 155-166 (2015). MSC: 68R15 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Balková, L’ubomíra; Pelantová, Edita; Starosta, Štěpán Infinite words with finite defect. (English) Zbl 1225.68139 Adv. Appl. Math. 47, No. 3, 562-574 (2011). MSC: 68R15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Balková, L’.; Pelantová, E.; Starosta, Š. On Brlek-Reutenauer conjecture. (English) Zbl 1247.68202 Theor. Comput. Sci. 412, No. 41, 5649-5655 (2011); corrigendum ibid. 465, 73-74 (2012). Reviewer: Anton Cerny (Safat) MSC: 68R15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Brlek, S.; Reutenauer, C. Complexity and palindromic defect of infinite words. (English) Zbl 1209.68395 Theor. Comput. Sci. 412, No. 4-5, 493-497 (2011). MSC: 68R15 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Carpi, Arturo; D’Alonzo, Valerio On factors of synchronized sequences. (English) Zbl 1238.68114 Theor. Comput. Sci. 411, No. 44-46, 3932-3937 (2010). MSC: 68R15 × Cite Format Result Cite Review PDF Full Text: DOI
Bucci, Michelangelo; De Luca, Alessandro; Glen, Amy; Zamboni, Luca Q. A connection between palindromic and factor complexity using return words. (English) Zbl 1160.68027 Adv. Appl. Math. 42, No. 1, 60-74 (2009). MSC: 68R15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Blondin-Massé, A.; Brlek, S.; Garon, A.; Labbé, S. Combinatorial properties of \(f\)-palindromes in the Thue-Morse sequence. (English) Zbl 1224.68067 PU.M.A., Pure Math. Appl. 18, No. 2-3, 39-52 (2008). MSC: 68R15 05A05 × Cite Format Result Cite Review PDF
de Luca, Aldo; Glen, Amy; Zamboni, Luca Q. Rich, Sturmian, and trapezoidal words. (English) Zbl 1153.68045 Theor. Comput. Sci. 407, No. 1-3, 569-573 (2008). MSC: 68R15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Borel, Jean-Pierre A geometrical characterization of factors of multidimensional billiard words and some applications. (English) Zbl 1115.68120 Theor. Comput. Sci. 380, No. 3, 286-303 (2007). MSC: 68R15 × Cite Format Result Cite Review PDF Full Text: DOI
Baláži, Peter; Masáková, Zuzana; Pelantová, Edita Factor versus palindromic complexity of uniformly recurrent infinite words. (English) Zbl 1119.68137 Theor. Comput. Sci. 380, No. 3, 266-275 (2007). MSC: 68R15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Ambrož, Petr; Masáková, Zuzana; Pelantová, Edita; Frougny, Christiane Palindromic complexity of infinite words associated with simple Parry numbers. (English) Zbl 1121.68089 Ann. Inst. Fourier 56, No. 7, 2131-2160 (2006). MSC: 68R15 11A63 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Numdam EuDML
Damanik, D.; Solomyak, B. Some high-complexity Hamiltonians with purely singular continuous spectrum. (English) Zbl 1021.34074 Ann. Henri Poincaré 3, No. 1, 99-105 (2002). Reviewer: Jean-Paul Allouche (Orsay) MSC: 34L40 34L05 47B39 47B80 × Cite Format Result Cite Review PDF Full Text: DOI