Inner palindromic closure

DOI10.1142/S0129054114400231MaRDI QIDQ5247174zbMATH OpenOpenAlexFDO

Authors Florin Manea, Robert Mercaş, Mike Müller, Jürgen 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

palindromic closureregular languages

Mathematics Subject Classification ID

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

Recommendations

• Inner palindromic closure
• On some problems related to palindrome closure
• Pseudopalindrome closure operators in free monoids
• On the fixed points of the iterated pseudopalindromic closure operator
• The pseudopalindromic completion of regular languages

Cites work

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

Cited in

(5)

• On the aperiodic avoidability of binary patterns with variables and reversals
• Geometric palindromic closure
• On some problems related to palindrome closure
• Inner palindromic closure
• On the fixed points of the iterated pseudopalindromic closure operator

This page was built for publication: Inner palindromic closure

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