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)
subword; unambiguity; matrix equivalence; scattered subword; Parikh matrix; Lyndon image; print of a word
68R15: Combinatorics on words
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
Related Items
On Core Words and the Parikh Matrix Mapping, Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism, Criteria for the matrix equivalence of words, Subword balance, position indices and power sums, Core words and Parikh matrices, TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES, PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY, Binary Images, M −Vectors, and Ambiguity, POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS
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
