Palindromic length of words and morphisms in class
Authors:
- Petr AmbrožPAPetr Ambrož
- Ondřej KadlecOKOndřej Kadlec
- Zuzana MasákováZMZuzana Masáková
- Edita PelantováEPEdita Pelantová
- 1 August 2019
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 780, 74-83
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Regional Development Fund (CZ.02.1.01/0.0/0.0/16_019/0000778)
- Czech Technical University in Prague (SGS17/193/OHK4/3T/14)
This publication has 18 references indexed in Scilit:
- A subquadratic algorithm for minimum palindromic factorizationJournal of Discrete Algorithms, 2014
- On palindromic factorization of wordsAdvances in Applied Mathematics, 2013
- Mirror substitutions and palindromic sequencesTheoretical Computer Science, 2007
- Pseudopalindrome closure operators in free monoidsTheoretical Computer Science, 2006
- On the palindromic and primitive widths of a free groupJournal of Algebra, 2005
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDSInternational Journal of Foundations of Computer Science, 2004
- Palindrome complexityTheoretical Computer Science, 2003
- Episturmian words and some constructions of de Luca and RauzyTheoretical Computer Science, 2001
- Singular continuous spectrum for palindromic Schrödinger operatorsCommunications in Mathematical Physics, 1995
- Puissance de mots et reconnaissabilité des points fixes d'une substitutionTheoretical Computer Science, 1992