A New Operator over Parikh Languages

DOI10.1142/S0129054116500271zbMath1351.68131MaRDI QIDQ5298313

Wen Chean Teh, Adrian Atanasiu

Publication date: 14 December 2016

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

zbMATH Keywords

\(M\)-equivalenceParikh matricessubwords-shuffle operator

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

A toolkit for Parikh matrices ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ Algebraic properties of Parikh matrices of binary picture arrays ⋮ On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices ⋮ On M-Equivalence and Strong M-Equivalence for Parikh Matrices ⋮ Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator ⋮ Reducing the ambiguity of Parikh matrices ⋮ Parikh matrices for powers of words ⋮ A New Study of Parikh Matrices Restricted to Terms

Cites Work

• Some characterizations of Parikh matrix equivalent binary words
• Criteria for the matrix equivalence of words
• Closure properties of slender languages
• Core words and Parikh matrices
• Parikh matrices and amiable words
• PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
• PARIKH MATRIX MAPPING AND LANGUAGES
• PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• On Core Words and the Parikh Matrix Mapping
• On Context-Free Languages

This page was built for publication: A New Operator over Parikh Languages