Independence of certain quantities indicating subword occurrences

DOI10.1016/j.tcs.2006.06.025zbMath1100.68058MaRDI QIDQ2508977

Arto Salomaa

Publication date: 20 October 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.025

zbMATH Keywords

ambiguity; subword; number of subwords; scattered subword; Parikh matrix; independence of subwords

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES, On Core Words and the Parikh Matrix Mapping, Subword histories and associated matrices, Criteria for the matrix equivalence of words, Subword balance, position indices and power sums, Core words and Parikh matrices, Parikh matrices and amiable words, Enriching Parikh matrix mappings, PARIKH MATRIX MAPPING AND LANGUAGES, PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM, POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS, COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES, ON SUBWORD SYMMETRY OF WORDS, Generalizations of Parikh mappings, ON PARIKH MATRICES

Cites Work

• Some characterizations of Parikh matrix equivalent binary words
• Subword conditions and subword histories
• Reconstruction of sequences
• Reconstruction from subsequences.
• Subword histories and Parikh matrices
• Extending Parikh matrices
• Connections between subwords and certain matrix mappings
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A sharpening of the Parikh mapping
• On Context-Free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item