Parikh matrices, amiability and Istrail morphism

DOI10.1142/S0129054110007702zbMATH Open1206.68246MaRDI QIDQ3069741FDOQ3069741

Adrian Atanasiu

Publication date: 19 January 2011

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

Recommendations

• Morphisms on amiable words
• Parikh matrices and amiable words
• BINARY AMIABLE WORDS
• PARIKH MATRIX MAPPING AND LANGUAGES
• scientific article; zbMATH DE number 1735821

zbMATH Keywords

Parikh matrix mappingsubword occurrencesamiable wordsscattered subwordsIstrail morphism

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

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

Cited In (11)

• Title not available (Why is that?)
• On a conjecture about Parikh matrices
• Parikh word representable graphs and morphisms
• On Core Words and the Parikh Matrix Mapping
• Separability of \(M\)-equivalent words by morphisms
• On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
• Core words and Parikh matrices
• A New Operator over Parikh Languages
• Title not available (Why is that?)
• BINARY AMIABLE WORDS
• Several extensions of the Parikh matrix \(L\)-morphism

This page was built for publication: Parikh matrices, amiability and Istrail morphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069741)