Elementary matrix equivalence and core transformation graphs for Parikh matrices
From MaRDI portal
Publication:1627871
DOI10.1016/J.DAM.2018.06.002zbMath1401.05262OpenAlexW2809892135WikidataQ129617388 ScholiaQ129617388MaRDI QIDQ1627871
Wen Chean Teh, Ghajendran Poovanandran
Publication date: 3 December 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.002
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (7)
Parikh word representability of bipartite permutation graphs ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Freeness Problem for Matrix Semigroups of Parikh Matrices ⋮ Unnamed Item ⋮ Erasure and error correcting ability of Parikh matrices ⋮ A New Study of Parikh Matrices Restricted to Terms
Cites Work
- Unnamed Item
- Unnamed Item
- On a conjecture about Parikh matrices
- Some characterizations of Parikh matrix equivalent binary words
- Criteria for the matrix equivalence of words
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Parikh matrices and amiable words
- Parikh Matrices and Strong M-Equivalence
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- On M-Equivalence and Strong M-Equivalence for Parikh Matrices
- Parikh Matrices and Parikh Rewriting Systems
- On Core Words and the Parikh Matrix Mapping
- On Context-Free Languages
This page was built for publication: Elementary matrix equivalence and core transformation graphs for Parikh matrices