SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
From MaRDI portal
Publication:5187854
DOI10.1142/S0129054110007155zbMath1187.68300MaRDI QIDQ5187854
Publication date: 9 March 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (15)
PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ A toolkit for Parikh matrices ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism ⋮ Subword balance, position indices and power sums ⋮ Binary Images, M −Vectors, and Ambiguity ⋮ Criteria for the matrix equivalence of words ⋮ Reducing the ambiguity of Parikh matrices ⋮ Separability of M-Equivalent Words by Morphisms ⋮ POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS ⋮ Parikh matrices for powers of words ⋮ On Core Words and the Parikh Matrix Mapping ⋮ TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES ⋮ Core words and Parikh matrices
Cites Work
- Some characterizations of Parikh matrix equivalent binary words
- Subword conditions and subword histories
- Subword histories and associated matrices
- 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
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- ON PARIKH MATRICES
This page was built for publication: SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
