17 papers:
DLT-2015-BannaiGIKKPPS- Diverse Palindromic Factorization Is NP-complete (HB, TG, SI, JK, DK, MP, SJP, SS), pp. 85–96.
- DLT-2015-BrlekLP #complexity
- Palindromic Complexity of Trees (SB, NL, XP), pp. 155–166.
- DLT-J-2013-DassowMMM14
- Inner Palindromic Closure (JD, FM, RM, MM), pp. 1049–1064.
- DLT-2014-KarhumakiP #on the #word
- On k-Abelian Palindromic Rich and Poor Words (JK, SP), pp. 191–202.
CIAA-2013-HasanIRS #automaton #on the #sequence- On Palindromic Sequence Automata and Applications (MMH, ASMSI, MSR, AS), pp. 158–168.
- CIAA-2013-IbarraR #problem
- Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages (OHI, BR), pp. 193–207.
- DLT-2013-DassowMMM
- Inner Palindromic Closure (JD, FM, RM, MM), pp. 155–166.
AFL-J-2011-FazekasLS12 #context-free grammar #on the- On Non-Primitive Palindromic Context-Free Languages (SZF, PL, KST), pp. 1277–1290.
KDD-2012-SpeiserALS #on the- On nested palindromes in clickstream data (MS, GA, AL, JS), pp. 1460–1468.
- AFL-2011-FazekasLS
- Palindromes and Primitivity (SZF, PL, KST), pp. 184–196.
- DLT-2011-PelantovaS #infinity #word
- Infinite Words Rich and Almost Rich in Generalized Palindromes (EP, SS), pp. 406–416.
LATA-2008-AndersonRSS #automaton #finite- Finite Automata, Palindromes, Powers, and Patterns (TA, NR, NS, JS), pp. 52–63.
- DLT-J-2005-LucaL06 #combinator
- Combinatorial Properties of Sturmian Palindromes (AdL, ADL), pp. 557–574.
- DLT-2005-BorelR #word
- Some New Results on Palindromic Factors of Billiard Words (JPB, CR), pp. 180–188.
- DLT-2005-LucaL #word
- Palindromes in Sturmian Words (AdL, ADL), pp. 199–208.
ICALP-1992-ApostolicoBG #algorithm #parallel- Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract) (AA, DB, ZG), pp. 296–307.
STOC-1976-Galil #algorithm #realtime #recognition #string- Real-Time Algorithms for String-Matching and Palindrome Recognition (ZG), pp. 161–173.
