Subword histories and associated matrices

DOI10.1016/j.tcs.2008.05.023zbMath1154.68076OpenAlexW1972014130MaRDI QIDQ954996

Arto Salomaa

Publication date: 18 November 2008

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

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

zbMATH Keywords

subwordsubword historyscattered subwordParikh matrix

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

COUNTING SUBWORDS USING A TRIE AUTOMATON ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ Binary Images, M −Vectors, and Ambiguity ⋮ Criteria for the matrix equivalence of words ⋮ SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES ⋮ PARIKH MATRIX MAPPING AND LANGUAGES ⋮ Erasure and error correcting ability of Parikh matrices ⋮ Parikh Matrices and Strong M-Equivalence ⋮ Enriching Parikh matrix mappings ⋮ On Core Words and the Parikh Matrix Mapping ⋮ TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES ⋮ Core words and Parikh matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of Parikh matrix equivalent binary words
• Subword conditions and subword histories
• Subword histories and Parikh matrices
• Extending Parikh matrices
• On fairness of D0L systems
• Parikh matrices and amiable words
• Connections between subwords and certain matrix mappings
• Independence of certain quantities indicating subword occurrences
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A sharpening of the Parikh mapping
• COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES
• ON INEQUALITIES BETWEEN SUBWORD HISTORIES

This page was built for publication: Subword histories and associated matrices