Reconstructing words from a -palindromic language

DOI10.3233/FI-2014-1112zbMATH Open1322.68146MaRDI QIDQ5259285FDOQ5259285

Srečko Brlek, Nadia Lafrenière

Publication date: 26 June 2015

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Recommendations

• Combinatorial properties of \(f\)-palindromes in the Thue-Morse sequence
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• On theta-palindromic richness
• Pseudopalindrome closure operators in free monoids
• Developments in Language Theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Combinatorics on words (68R15)

Cited In (1)

• Normalization of ternary generalized pseudostandard words

This page was built for publication: Reconstructing words from a \(\sigma\)-palindromic language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259285)