INNER PALINDROMIC CLOSURE

DOI10.1142/S0129054114400231zbMath1310.68128OpenAlexW2159274815MaRDI QIDQ5247174

Mike Müller, Florin Manea, Robert Mercaş, Juergen Dassow

Publication date: 23 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054114400231

zbMATH Keywords

regular languagespalindromic closure

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (1)

On the aperiodic avoidability of binary patterns with variables and reversals

Cites Work

• Avoiding large squares in infinite binary words
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• On regularity of languages generated by copying systems
• On the regularity of languages on a binary alphabet generated by copying systems
• Sturmian words: structure, combinatorics, and their arithmetics
• Hairpin Completion with Bounded Stem-Loop
• Hairpin Structures in DNA Words
• LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS
• Ordering by Divisibility in Abstract Algebras
• Watson-Crick palindromes in DNA computing

This page was built for publication: INNER PALINDROMIC CLOSURE