Palindrome words and reverse closed languages

DOI10.1080/00207160008804994zbMath0982.94011OpenAlexW2091357449MaRDI QIDQ4521948

No author found.

Publication date: 9 September 2001

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

Full work available at URL: https://doi.org/10.1080/00207160008804994

zbMATH Keywords

regular languageprimitive wordpalindrome languagepalindrome wordreverse closed finite maximal prefix codesreverse closed language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (9)

A note of ins-primitive words ⋮ A relation by palindromic subwords ⋮ A note of prefix n-primitive words ⋮ Some properties of related involution palindrome words ⋮ Two-Dimensional Palindromes and Their Properties ⋮ A note on pure codes ⋮ Prefix Primitive Languages ⋮ Properties of pure codes ⋮ Word-paired insertions of languages

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• On some combinatorial problems in free monoids
• A factor theorem for subsets of a free monoid
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Palindrome words and reverse closed languages