On some combinatorial problems in free monoids

DOI10.1016/0012-365X(82)90290-4zbMath0477.05013MaRDI QIDQ1160130

Aldo De Luca

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

rearrangementfinitely generated free monoid

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Word problems, etc. in computability and recursion theory (03D40) Semigroups (20M99)

Related Items (9)

Palindrome words and reverse closed languages ⋮ Some properties of involution codes ⋮ A combinatorial property of the Fibonacci words ⋮ Some properties of related involution palindrome words ⋮ A note of solutions to the morphic involution language equations ⋮ A note on pure codes ⋮ Prefix-primitive annihilators of languages under some operations ⋮ Pseudopalindrome closure operators in free monoids ⋮ Solutions to the involution language equation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Fast Pattern Matching in Strings
• Uniqueness Theorems for Periodic Functions

This page was built for publication: On some combinatorial problems in free monoids