PARIKH MATRIX MAPPING AND LANGUAGES

DOI10.1142/S0129054110007684zbMath1215.68118MaRDI QIDQ3069739

Radu Atanasiu

Publication date: 19 January 2011

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

zbMATH Keywords

formal languagesregular languagesChomsky hierarchyParikh matrix mappingamiable wordsscattered subwords

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (7)

A New Operator over Parikh Languages ⋮ PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY ⋮ Separability of M-Equivalent Words by Morphisms ⋮ Erasure and error correcting ability of Parikh matrices ⋮ Enriching Parikh matrix mappings ⋮ On Core Words and the Parikh Matrix Mapping ⋮ Core words and Parikh matrices

Cites Work

• Some characterizations of Parikh matrix equivalent binary words
• Subword histories and associated matrices
• 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 Context-Free Languages

This page was built for publication: PARIKH MATRIX MAPPING AND LANGUAGES