A toolkit for Parikh matrices

DOI10.1007/978-3-031-07469-1_9OpenAlexW4285138072MaRDI QIDQ2164742

Laura K. Hutchinson, Robert Mercaş, Daniel Reidenbach

Publication date: 16 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07469-1_9

zbMATH Keywords

Parikh matricestoolkit\( \mathbb{L} \)-Parikh matrices\( \mathbb{P} \)-Parikh matricesamiable words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

When is context-freeness distinguishable from regularity? An extension of Parikh's theorem

Cites Work

• Several extensions of the Parikh matrix \(L\)-morphism
• Some characterizations of Parikh matrix equivalent binary words
• Extending Parikh matrices
• Parikh matrices and amiable words
• Gaussian elimination is not optimal
• PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A sharpening of the Parikh mapping
• Some Algebraic Aspects of Parikh q-Matrices
• Factorizing words over an ordered alphabet
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• The binomial equivalence classes of finite words
• SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
• Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence
• Lie Groups, Lie Algebras, and Representations
• A New Operator over Parikh Languages
• On Context-Free Languages
• Reducing the ambiguity of Parikh matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: A toolkit for Parikh matrices