Universal rewriting rules for the Parikh matrix injectivity problem

DOI10.1007/978-3-031-66159-4_6MaRDI QIDQ7034842zbMATH OpenFDO

Authors Ingyu Baek, Joonghyuk Hahn, Yo-Sub Han, Kai Salomaa

Publication date 31 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-66159-4_6

zbMATH Keywords

\(M\)-equivalenceexponent-stringParikh matrixstrong \(M\)-equivalence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• M-equivalence of Parikh matrix over a ternary alphabet
• A new study of Parikh matrices restricted to terms
• A sharpening of the Parikh mapping
• A toolkit for Parikh matrices
• BINARY AMIABLE WORDS
• scientific article; zbMATH DE number 1735821 (Why is no real title available?)
• scientific article; zbMATH DE number 2182445 (Why is no real title available?)
• Injectivity of the Parikh matrix mappings revisited
• On Context-Free Languages
• Parikh matrices and amiable words
• Parikh matrices and strong M-equivalence
• Parikh matrices for powers of words
• Parikh q-Matrices and q-Ambiguous Words
• Reducing the ambiguity of Parikh matrices
• Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
• Uniformly growing k-th power-free homomorphisms

Cited in

(1)

• Ternary is still good for Parikh matrices

This page was built for publication: Universal rewriting rules for the Parikh matrix injectivity problem

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