Counting subwords in circular words and their Parikh matrices

DOI10.1016/j.tcs.2023.114344arXiv2110.14858OpenAlexW3210836236MaRDI QIDQ6185846

Wen Chean Teh, R. Jamie Simpson, Ghajendran Poovanandran

Publication date: 8 January 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.14858

zbMATH Keywords

necklacerewriting rulescircular splicing systems\(k\)-spectrumsubsequences of strings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a conjecture about Parikh matrices
• Palindromes in circular words
• Relations on words
• A characterization of (regular) circular languages generated by monotone complete splicing systems
• On ternary square-free circular words
• Criteria for the matrix equivalence of words
• Reconstruction of sequences
• Reconstruction from subsequences.
• Elementary matrix equivalence and core transformation graphs for Parikh matrices
• On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
• Subword histories and Parikh matrices
• Parikh word representability of bipartite permutation graphs
• \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
• Parikh matrices for powers of words
• Separating many words by counting occurrences of factors
• \(k\)-spectra of weakly-\(c\)-balanced words
• Parikh determinants
• Parikh matrices and amiable words
• Independence of certain quantities indicating subword occurrences
• On the power of circular splicing
• TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES
• PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
• A sharpening of the Parikh mapping
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• Theory Is Forever
• Reducing the ambiguity of Parikh matrices

This page was built for publication: Counting subwords in circular words and their Parikh matrices