Counting bordered and primitive words with a fixed weight
From MaRDI portal
Publication:2484439
DOI10.1016/j.tcs.2005.03.040zbMath1078.68115OpenAlexW1979998437MaRDI QIDQ2484439
Publication date: 1 August 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.040
Related Items
Avoiding cross-bifix-free binary words ⋮ Coding by minimal linear grammars ⋮ Smallest and Largest Block Palindrome Factorizations ⋮ Some operations preserving primitivity of words ⋮ INVOLUTIVELY BORDERED WORDS
Uses Software
Cites Work