Parikh Matrices and Parikh Rewriting Systems

DOI10.3233/FI-2016-1388zbMath1371.68138OpenAlexW2246424403MaRDI QIDQ4976391

Wen Chean Teh

Publication date: 28 July 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1388

zbMATH Keywords

\(M\)-equivalenceinjectivity problemsubwordParikh matrixParikh rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)

Related Items (9)

On a conjecture about Parikh matrices ⋮ Elementary matrix equivalence and core transformation graphs for Parikh matrices ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ Parikh Matrices: Subword Indicators and Degrees of Ambiguity ⋮ On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices ⋮ On M-Equivalence and Strong M-Equivalence for Parikh Matrices ⋮ Unnamed Item ⋮ Parikh matrices for powers of words

This page was built for publication: Parikh Matrices and Parikh Rewriting Systems