The pseudopalindromic completion of regular languages

DOI10.1016/J.IC.2014.09.001MaRDI QIDQ476182zbMATH OpenOpenAlexFDO

Authors Szilárd Zsolt Fazekas, Florin Manea, Robert Mercaş, Kayoko Shikishima-Tsuji

Publication date 28 November 2014

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2014.09.001

zbMATH Keywords

algorithmsdecidabilityregular languagespseudopalindromespseudopalindromic completionpseudopalindromic iterated completion

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Hairpin completion with bounded stem-loop
• Some remarks on the hairpin completion
• Language theoretical properties of hairpin formations
• Regularity of iterative hairpin completions of crossing \((2, 2)\)-words
• On the Hairpin Completion of Regular Languages

Cites work

• scientific article; zbMATH DE number 5722790 (Why is no real title available?)
• scientific article; zbMATH DE number 4033111 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• Algorithms on Strings, Trees and Sequences
• Bounded hairpin completion
• Hairpin Completion Versus Hairpin Reduction
• Hairpin Lengthening
• Hairpin completion with bounded stem-loop
• Hairpin languages
• Iterated hairpin completions of non-crossing words
• Linear work suffix array construction
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
• On iterated hairpin completion
• On some algorithmic problems regarding the hairpin completion
• On the Hairpin Completion of Regular Languages
• Pseudopalindrome closure operators in free monoids
• Some remarks on the hairpin completion
• Sturmian words: structure, combinatorics, and their arithmetics
• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
• Watson-Crick palindromes in DNA computing

Cited in

(7)

• Pseudo-inversion on formal languages
• Normalization of ternary generalized pseudostandard words
• Palindrome words and reverse closed languages
• Inner palindromic closure
• Absent Subsequences in Words
• Inner palindromic closure
• Hairpin completion with bounded stem-loop

This page was built for publication: The pseudopalindromic completion of regular languages

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