PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM

DOI10.1142/S0129054110007702zbMath1206.68246MaRDI QIDQ3069741

Adrian Atanasiu

Publication date: 19 January 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Parikh matrix mappingsubword occurrencesamiable wordsscattered subwordsIstrail morphism

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (7)

On a conjecture about Parikh matrices ⋮ Parikh word representable graphs and morphisms ⋮ A New Operator over Parikh Languages ⋮ Unnamed Item ⋮ Separability of M-Equivalent Words by Morphisms ⋮ On Core Words and the Parikh Matrix Mapping ⋮ Core words and Parikh matrices

Cites Work

• Some characterizations of Parikh matrix equivalent binary words
• Parikh matrices and amiable words
• Connections between subwords and certain matrix mappings
• Independence of certain quantities indicating subword occurrences
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• On Context-Free Languages

This page was built for publication: PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM